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

Batch scheduling in a multi-purpose system with machine downtime and a multi-skilled workforce

Author

Listed:
  • Ai Zhao
  • Jonathan F. Bard

Abstract

The paper presents a discrete-time mixed-integer linear programming (MILP) model for a generalised flexible job-shop scheduling problem as represented by a state-task network. The problem is characterised by reentrant flow, sequence-dependent changeover time, machine downtime, and skilled labour requirements. Two preprocessing procedures are proposed to reduce the size of the MILP model, and represent a major contribution of the research. The procedures reduce the number of assignment variables by exploiting job precedence and workforce qualifications. Machine availability for each task is determined as a function of possible start and end times, given duration, and maintenance schedule. The overall objective is to maximise the number of scheduled tasks while minimising their total finish time. Computational experiments are conducted with real and randomly generated instances. The results show that optimal solutions can be obtained for medium-size problems within a reasonable amount of time, primarily due to the use of the preprocessing procedures.

Suggested Citation

  • Ai Zhao & Jonathan F. Bard, 2024. "Batch scheduling in a multi-purpose system with machine downtime and a multi-skilled workforce," International Journal of Production Research, Taylor & Francis Journals, vol. 62(12), pages 4470-4493, June.
    • Handle: RePEc:taf:tprsxx:v:62:y:2024:i:12:p:4470-4493
    DOI: 10.1080/00207543.2023.2265508
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2023.2265508
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2023.2265508?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:62:y:2024:i:12:p:4470-4493. 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.