๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Heuristic algorithms for scheduling in the no-wait flowshop

โœ Scribed by Rajesh Gangadharan; Chandrasekharan Rajendran


Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
411 KB
Volume
32
Category
Article
ISSN
0925-5273

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Heuristics for two-machine no-wait flows
โœ 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