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

An improved algorithm for the two machine flow shop problem with several availability constraints

โœ Scribed by Hatem Hadda

Publisher
Springer
Year
2010
Tongue
English
Weight
256 KB
Volume
8
Category
Article
ISSN
1619-4500

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An exact algorithm for the batch sequenc
An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer
โœ A. Agnetis; F. Rossi; G. Gristina ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 295 KB ๐Ÿ‘ 2 views

This paper deals with the problem of makespan minimization in a flow shop with two machines when the input buffer of the second machine can only host a limited number of parts. Here we analyze the problem in the context of batch processing, i.e., when identical parts must be processed consecutively.