IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v58y2020i12p3554-3569.html
   My bibliography  Save this article

The use of finite loading to guide short-term capacity adjustments in make-to-order job shops: an assessment by simulation

Author

Listed:
  • Matthias Thürer
  • Mark Stevenson

Abstract

Although there is a broad literature on capacity management, there has been only limited attention on how to support short-term capacity control decisions, especially in high-variety make-to-order shops. While finite loading has been identified as a potential means of guiding capacity adjustments, the actual performance impact of this solution has not been adequately assessed. Using a simulation model of a make-to-order job shop, we compare the performance impact of four different forward and backward finite loading methods and a load trigger method recently presented in the literature. Results confirm the potential of finite loading to improve performance when compared to a general capacity increase. Yet all four methods are outperformed by the load trigger method. The capacity adjustments made under finite loading methods are determined by individual jobs and their properties. This may lead to no adjustments despite an overload period (e.g. if a job has a long due date but only one overload station in its routing) or to unnecessary adjustments when there is no overload (e.g. if a large job has a tight due date). This finding draws into question the use of finite loading altogether and reinforces the importance of the load trigger method.

Suggested Citation

  • Matthias Thürer & Mark Stevenson, 2020. "The use of finite loading to guide short-term capacity adjustments in make-to-order job shops: an assessment by simulation," International Journal of Production Research, Taylor & Francis Journals, vol. 58(12), pages 3554-3569, June.
  • Handle: RePEc:taf:tprsxx:v:58:y:2020:i:12:p:3554-3569
    DOI: 10.1080/00207543.2019.1630771
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2019.1630771
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2019.1630771?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    More about this item

    Statistics

    Access and download statistics

    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:taf:tprsxx:v:58:y:2020:i:12:p:3554-3569. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.