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

Makespan minimization in a no-wait flow shop problem with two batching machines

โœ Scribed by Ammar Oulamara

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

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Minimizing the makespan in the two-machi
Minimizing the makespan in the two-machine no-wait flow-shop with limited machine availability
โœ M.L. Espinouse; P. Formanowicz; B. Penz ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 307 KB

This paper deals with the two-machine no-wait flow-shop problem with limited machine availability. In this model, we assume that machines may not always be available, for example because of preventive maintenance. We only consider the deterministic case where the unavailable periods are known in adv