𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Sensitivity analysis in the single-machine scheduling problem with max–min criterion

✍ Scribed by Stefan Chanas; Adam Kasperski

Book ID
111205793
Publisher
John Wiley and Sons
Year
2005
Tongue
English
Weight
144 KB
Volume
12
Category
Article
ISSN
0969-6016

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimizing maximal regret in the single
Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
✍ Adam Kasperski 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 170 KB

In this paper, the single machine sequencing problem with maximum lateness criterion is discussed. The parameters of the problem are imprecise and they are specified as intervals. The maximal regret criterion is applied to calculate the optimal sequence. A polynomial algorithm for the studied proble

Possible and necessary optimality of sol
Possible and necessary optimality of solutions in the single machine scheduling problem with fuzzy parameters
✍ Stefan Chanas; Adam Kasperski 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 386 KB

The single machine scheduling problem with parameters given in the form of fuzzy numbers is considered. It is assumed that the optimal schedule in such a problem cannot be determined precisely (since the parameters of the problem are not known a priori). In this paper the concepts of possible and ne