Flow-shop problems with intermediate buffers

Autor(en): Brucker, P
Heitmann, S
Hurink, J
Stichwörter: buffer; flow-shop problem; MACHINE; Operations Research & Management Science; SEARCH ALGORITHM; SHOP SCHEDULING PROBLEM; STORAGE; tabu search
Erscheinungsdatum: 2003
Volumen: 25
Ausgabe: 4
Startseite: 549
Seitenende: 574
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.
ISSN: 01716468
DOI: 10.1007/s00291-003-0133-7

Show full item record

Page view(s)

Last Week
Last month
checked on Feb 26, 2024

Google ScholarTM