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

An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint

โœ Scribed by Xiuli Wang; T.C. Edwin Cheng

Book ID
108105741
Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
177 KB
Volume
34
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.

๐Ÿ“œ 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