Job-shop scheduling with limited capacity buffers

Autor(en): Brucker, P
Heitmann, S
Hurink, J
Nieberg, T
Stichwörter: alternative graph; buffer; disjunctive graph; job-shop problem; Operations Research & Management Science; PERMUTATION FLOW-SHOP; STORAGE
Erscheinungsdatum: 2006
Herausgeber: SPRINGER
Volumen: 28
Ausgabe: 2
Startseite: 151
Seitenende: 176
In this paper we investigate job-shop problems where limited capacity buffers to store jobs in non-processing periods are present. In such a problem setting, 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 a prespecified buffer. If the buffer is completely occupied the job may wait on its current machine but blocks this machine for other jobs. Besides a general buffer model, also specific configurations are considered. The aim of this paper is to find a compact representation of solutions for the jobshop problem with buffers. In contrast to the classical job-shop problem, where a solution may be given by the sequences of the jobs on the machines, now also the buffers have to be incorporated in the solution representation. In a first part, two such representations are proposed, one which is achieved by adapting the alternative graph model and a second which is based on the disjunctive graph model. In a second part, it is investigated whether the given solution representation can be simplified for specific buffer configurations. For the general buffer configuration it is shown that an incorporation of the buffers in the solution representation is necessary, whereas for specific buffer configurations possible simplifications are presented.
ISSN: 01716468
DOI: 10.1007/s00291-005-0008-1

Show full item record

Page view(s)

Last Week
Last month
checked on Feb 28, 2024

Google ScholarTM