✦ LIBER ✦

Minimum deviation algorithm for two-stageno-wait flowshops with parallel machines

✍ Scribed by Jinxing Xie; Wenxun Xing; Zhixin Liu; Jiefang Dong

Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 518 KB
Volume: 47
Category: Article
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2003.08.003

No coin nor oath required. For personal study only.

✦ Synopsis

The scheduling problems studied in this paper concern the two-stage no-walt flowshops with parallel machines under the objective function of the minimization of the maximum completion time. A new heuristic algorithm, i.e., the minimum deviation algorithm, is developed to solve the problems. In order to evaluate the average case performance of the algorithm, we design numerical experiments to compare the effectiveness of the algorithm with that of the other approximation algorithms. Extensive simulations axe conducted under different shop conditions, and the results statistically show that the minimum deviation algorithm performs well under most of the situations.

📜 SIMILAR VOLUMES

Performance of scheduling algorithms for

Performance of scheduling algorithms for no-wait flowshops with parallel machines

✍ C. Sriskandarajah 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 969 KB

Heuristics for two-machine no-wait flows

Heuristics for two-machine no-wait flowshop scheduling with an availability constraint

✍ Guoqing Wang; T.C.Edwin Cheng 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 75 KB

In this paper we study the two-machine no-wait flowshop problem with an availability constraint. The problem has been shown to be NP-hard, and some heuristics with a worst-case error bound of 2 have been developed for it. We provide two improved heuristics for the problem, and show that each has a w