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

Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint

โœ Scribed by Chung-Yee Lee

Book ID
108410514
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
712 KB
Volume
20
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Makespan minimization in the two-machine
Makespan minimization in the two-machine flowshop batch scheduling problem
โœ T.C.E. Cheng; B.M.T. Lin; A. Toker ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 202 KB ๐Ÿ‘ 2 views

In this paper we consider a practical scheduling problem commonly arising from batch production in a flexible manufacturing environment. Different part-types are to be produced in a flexible manufacturing cell organized into a two-stage production line. The jobs are processed in batches on the first

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