Scheduling and buffer reduction algorithm for job shop production systems Online publication date: Fri, 27-Dec-2013
by Gonzalo Mejía; Guillermo González-Vargas; Felipe González
International Journal of Industrial and Systems Engineering (IJISE), Vol. 13, No. 3, 2013
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Industrial and Systems Engineering (IJISE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook