Scheduling and buffer reduction algorithm for job shop production systems

Gonzalo Mejía, Guillermo González-Vargas and Felipe González

International Journal of Industrial and Systems Engineering, 2013, vol. 13, issue 3, 345-363

Abstract: Buffer management is a complex problem in the operation of production systems. Poor buffer control may cause congestion and may increase work in process and cycle times. This paper proposes a methodology which attempts to reduce the buffer requirements in job shop production systems. The first step of this approach consists of finding a near-optimal schedule. Next a number of right-shift and left-shift movements are performed within the schedule with the objective of reducing the amount of required buffer slots. The initial schedule is calculated with modified simulated annealing algorithm; the second step is essentially changing the start and/or finish operation dates without changing neither the sequence of jobs on each machine nor the value of the objective function. This last step uses machine blockings to further reduce the amount of buffers. The procedure was tested on a number of benchmark problems from the literature. The obtained results show up to 36% in buffer reduction.

Keywords: job shop scheduling; buffer management; simulated annealing; buffer reduction. (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=52281 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijisen:v:13:y:2013:i:3:p:345-363

Access Statistics for this article

More articles in International Journal of Industrial and Systems Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().