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

Scheduling in a no-wait flow shop to minimise total earliness and tardiness with additional idle time allowed

Author

Listed:
  • Jeffrey Schaller
  • Jorge M. S. Valente

Abstract

Scheduling jobs in a no-wait flow shop with the objective of minimising total earliness and tardiness is the problem addressed in this paper. Idle time may be needed on the first machine due to the no-wait restriction. A model is developed that shows additional idle can be inserted on the first machine to help reduce earliness. Several dispatching heuristics previously used in other environments were modified and tested. A two-phased procedure was also developed, estimating additional idle in the first phase, and applying dispatching heuristics in the second phase. Several versions of an insertion improvement procedure were also developed. The procedures are tested on instances of various sizes and due date tightness and range. The results show the two-phase heuristics are more effective than the simple rules, and the insertion search improvement procedure can provide considerable improvements.

Suggested Citation

  • Jeffrey Schaller & Jorge M. S. Valente, 2022. "Scheduling in a no-wait flow shop to minimise total earliness and tardiness with additional idle time allowed," International Journal of Production Research, Taylor & Francis Journals, vol. 60(18), pages 5488-5504, September.
    • Handle: RePEc:taf:tprsxx:v:60:y:2022:i:18:p:5488-5504
    DOI: 10.1080/00207543.2021.1962017
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2021.1962017
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2021.1962017?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:60:y:2022:i:18:p:5488-5504. 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.