𝔖 Bobbio Scriptorium
✦   LIBER   ✦

No-wait flexible flowshop scheduling with no-idle machines

✍ Scribed by Zhenbo Wang; Wenxun Xing; Fengshan Bai

Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
165 KB
Volume
33
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

✦ Synopsis

This paper considers a two-stage flexible flowshop scheduling problem with no waiting time between two sequential operations of a job and no idle time between two consecutive processed jobs on machines of the second stage. We show its complexity and present a heuristic algorithm with asymptotically tight error bounds.

πŸ“œ SIMILAR VOLUMES

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

Note: On the two-machine no-idle flowsho
Note: On the two-machine no-idle flowshop problem
✍ OndΕ™ej Čepek; Masanori Okada; Milan Vlach πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 290 KB πŸ‘ 1 views

In this short note we study a two-machine flowshop scheduling problem with the additional no-idle feasibility constraint and the total completion time criterion function. We show that one of the few papers which deal with this special problem contains incorrect claims and suggest a way how these cla