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

A modified artificial bee colony algorithm for order acceptance in two-machine flow shops

โœ Scribed by Wang, Xiuli; Xie, Xingzi; Cheng, T.C.E.


Book ID
122784507
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
405 KB
Volume
141
Category
Article
ISSN
0925-5273

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


An exact algorithm for the batch sequenc
โœ 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.