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

An improved heuristic for two-machine flowshop scheduling with an availability constraint

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

Book ID
108410412
Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
220 KB
Volume
26
Category
Article
ISSN
0167-6377

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

Two-machine flowshop scheduling with ava
Two-machine flowshop scheduling with availability constraints
โœ Chung-Yee Lee ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 143 KB

The majority of the scheduling literature carries a common assumption that machines are available all the time. However, this availability assumption may not be true in real industry settings, since a machine may become unavailable during certain periods of time when, for instance, a machine breakdo