𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimal fuzzy counterparts of scheduling rules

✍ Scribed by Ertunga C. Özelkan; Lucien Duckstein

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
232 KB
Volume
113
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

✦ Synopsis

The optimality of a fuzzy logic alternative to the usual treatment of uncertainties in a scheduling system using probability theory is examined formally. Fuzzy scheduling techniques proposed in the literature either fuzzify directly the existing scheduling rules, or solve mathematical programming problems to determine the optimal schedules. In the former method, the fuzzy optimality for the optimal scheduling rules is usually not justi®ed but still assumed. In this paper, the necessary conditions for fuzzy optimality are de®ned, and fuzzy counterparts of some of the well-known scheduling rules such as shortest processing time (SPT) and earliest due date (EDD) are developed.

📜 SIMILAR VOLUMES

Optimal fuzzy rules cover extrema
Optimal fuzzy rules cover extrema
✍ Bart Kosko 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 314 KB

A fuzzy system approximates a function by covering the graph of the function with fuzzy rule patches and averaging patches that overlap. But the number of rules grows exponentially with the total number of input and output variables. The best rules cover the extrema or bumps in the function-they pat

Learning optimization in simplifying fuz
Learning optimization in simplifying fuzzy rules
✍ Xizhao Wang; Jiarong Hong 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 550 KB

It is important that an optimal learning problem is proved to be NP-hard and the heuristic algorithm for solving the problem has to be given. This paper deals with a learning problem appearing in the process of simplifying fuzzy rules, proves that the solution optimization is NP-hard and gives its h