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 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.
Similar content being viewed by others
References
Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows. Prentice Hall, Englewood Cliffs
Brucker P (2004) Scheduling algorithms, 4th edn., Springer, Berlin Heidelberg New York
Brucker P, Heitmann S, Hurink J (2003) Flow-shop problems with intermediate, buffers. OR Spectrum 25:549-574
Leisten R (1990) Flowshop sequencing problems with limited buer storage. Int J Prod Res 28:2085-2100
Mascis A, Pacciarelli D (2002) Job-shop scheduling with blocking and no-wait, constraints. Eur J Oper Res 143:498–517
Nieberg, T (2002) Tabusuche für flow-shop und job-shop probleme mit begrenztem Zwischenspeicher. Master Thesis, University of Osnabrück
Nowicki E (1999) The permutationow shop with buffers: a tabu search approach. Eur J Oper Res 116:205–219
Papadimitriou CH, Kanellakis PC (1980) Flow shop scheduling with limited temporary storage. J Assoc Comput Mach 27:533–549
Smutnicki C (1998) A two-machine permutationow shop scheduling problem with buffers. OR Spektrum 20:229–235
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Brucker, P., Heitmann, S., Hurink, J. et al. Job-shop scheduling with limited capacity buffers. OR Spectrum 28, 151–176 (2006). https://doi.org/10.1007/s00291-005-0008-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00291-005-0008-1