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