Job-shop scheduling with limited capacity buffers

Share/Save/Bookmark

Brucker, Peter and Heitmann, Silvia and Hurink, Johann and Nieberg, Tim (2006) Job-shop scheduling with limited capacity buffers. OR Spectrum, 28 (2). pp. 151-176. ISSN 0171-6468

[img] PDF - Published Version
Restricted to UT campus only
: Request a copy
201kB
Abstract: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 job-shop 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.
Item Type:Article
Copyright:© 2006 Springer
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/66029
Official URL:http://dx.doi.org/10.1007/s00291-005-0008-1
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 238055