IDEAS home Printed from https://ideas.repec.org/a/ids/ijisen/v13y2013i3p345-363.html
   My bibliography  Save this article

Scheduling and buffer reduction algorithm for job shop production systems

Author

Listed:
  • Gonzalo Mejía
  • Guillermo González-Vargas
  • Felipe González

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.

Suggested Citation

  • Gonzalo Mejía & Guillermo González-Vargas & Felipe González, 2013. "Scheduling and buffer reduction algorithm for job shop production systems," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 13(3), pages 345-363.
    • Handle: RePEc:ids:ijisen:v:13:y:2013:i:3:p:345-363
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=52281
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijisen:v:13:y:2013:i:3:p:345-363. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=188 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.