𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Genetic algorithms for minimizing makespan in a flow shop with two capacitated batch processing machines

✍ Scribed by Praveen Kumar Manjeshwar; Purushothaman Damodaran; Krishnaswami Srihari

Publisher
Springer
Year
2011
Tongue
English
Weight
258 KB
Volume
55
Category
Article
ISSN
0268-3768

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Fast algorithms to minimize the makespan
Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times
✍ Jinliang Cheng; George Steiner; Paul Stephenson πŸ“‚ Article πŸ“… 2002 πŸ› Springer US 🌐 English βš– 186 KB πŸ‘ 2 views

We consider the two-machine ow-shop problem with release times where the objective is to minimize either the makespan or the maximum lateness. We present a uniΓΏed treatment of various sequenceinterchange operators and derive powerful new dominance orders, which are incorporated into branchand-bound

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.