Flow-shop problems with intermediate buffers


Brucker, Peter and Heitmann, Silvia and Hurink, Johann (2003) Flow-shop problems with intermediate buffers. OR Spectrum, 25 (4). pp. 549-574. ISSN 0171-6468

[img] PDF - Published Version
Restricted to UT campus only
: Request a copy
Abstract:In this paper the following extension of the classical flow-shop problem is considered: Between each two consecutive machines a buffer of limited capacity is given. After finishing processing on a machine, a job either directly has to be processed on the following machine or it has to be stored in the buffer between these machines. If the buffer is completely occupied the job may wait on its current machine but blocks this machine for other jobs. The objective is to determine a feasible schedule minimizing the makespan.

To model such a problem setting, a variation of the classical disjunctive graph model for shop problems is extended. A tabu search procedure is described where neighborhoods based on an extension of the classical block approach theorem are used. Computational results for extended flow-shop benchmark instances are presented.
Item Type:Article
Copyright:© 2003 Springer
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/62907
Official URL:https://doi.org/10.1007/s00291-003-0133-7
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page

Metis ID: 213409