IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v40y2023i05ns0217595923400195.html
   My bibliography  Save this article

Three-Stage Assembly Flow Shop Scheduling Problem with a Fixed Maintenance Period

Author

Listed:
  • Yuan Yuan

    (School of Information and Communication Engineering, Dalian Minzu University, Dalian, 116600, P. R. China)

  • Xin Han

    (School of Software Technology, Dalian University of Technology, Dalian, 116620, P. R. China)

  • Yong Zhou

    (School of Software Technology, Dalian University of Technology, Dalian, 116620, P. R. China)

  • Xingwu Liu

    (School of Mathematical Sciences, Dalian University of Technology, Dalian, 116620, P. R. China)

Abstract

This paper investigates the three-stage assembly flow shop scheduling problem, provided that there is a fixed maintenance period (MP) imposed on one of the machines in the first stage, the objective is to minimize the makespan. The starting time and duration of MP are known in advance, during MP no job can be processed on the corresponding machine. Only the non-resumable scenario is considered, i.e., if a job fails to finish before MP, it must restart from the beginning after the machine becomes available again, rather than continuing its processing. The problem generalizes the three-stage assembly flow shop scheduling problem without MPs and is therefore strongly NP-hard. To the best of our knowledge, the problem has not been explored so far. We propose three approximation algorithms for the problem.

Suggested Citation

  • Yuan Yuan & Xin Han & Yong Zhou & Xingwu Liu, 2023. "Three-Stage Assembly Flow Shop Scheduling Problem with a Fixed Maintenance Period," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 40(05), pages 1-17, October.
    • Handle: RePEc:wsi:apjorx:v:40:y:2023:i:05:n:s0217595923400195
    DOI: 10.1142/S0217595923400195
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595923400195
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595923400195?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.

    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:wsi:apjorx:v:40:y:2023:i:05:n:s0217595923400195. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.