𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A modified genetic algorithm for the flow shop sequencing problem to minimize mean flow time

✍ Scribed by Lixin Tang; Jiyin Liu

Book ID
110323193
Publisher
Springer US
Year
2002
Tongue
English
Weight
141 KB
Volume
13
Category
Article
ISSN
0956-5515

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.