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

Production scheduling in a reconfigurable manufacturing system benefiting from human-robot collaboration

Author

Listed:
  • Behdin Vahedi-Nouri
  • Reza Tavakkoli-Moghaddam
  • Zdeněk Hanzálek
  • Alexandre Dolgui

Abstract

Nowadays, the manufacturing sector needs higher levels of flexibility to confront the extremely volatile market. Accordingly, exploiting both machine and workforce reconfigurability as two critical sources of flexibility is advantageous. In this regard, for the first time, this paper explores an integrated production scheduling and workforce planning problem in a Reconfigurable Manufacturing System (RMS) benefiting from reconfigurable machines and human-robot collaboration. A new Mixed-Integer Linear Programming (MILP) model and an efficient Constraint Programming (CP) model are developed to formulate the problem, minimising the makespan as the performance metric. Due to the high complexity of the problem, the MILP model cannot handle large-sized instances. Hence, to evaluate the performance of the CP model in large-sized instances, a lower bound is derived based on the relaxation of the problem. Finally, extensive computational experiments are carried out to assess the performance of the devised MILP and CP models and provide general recommendations for managers dealing with such a complex problem. The results reveal the superiority of the CP model over the MILP model in small- and medium-sized instances. Moreover, the CP model can find high-quality solutions for large-sized instances within a reasonable computational time.

Suggested Citation

  • Behdin Vahedi-Nouri & Reza Tavakkoli-Moghaddam & Zdeněk Hanzálek & Alexandre Dolgui, 2024. "Production scheduling in a reconfigurable manufacturing system benefiting from human-robot collaboration," International Journal of Production Research, Taylor & Francis Journals, vol. 62(3), pages 767-783, February.
  • Handle: RePEc:taf:tprsxx:v:62:y:2024:i:3:p:767-783
    DOI: 10.1080/00207543.2023.2173503
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207543.2023.2173503?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Alexander Lazarev & Nikolay Pravdivets & Egor Barashov, 2024. "Approximation of the Objective Function of Single-Machine Scheduling Problem," Mathematics, MDPI, vol. 12(5), pages 1-16, February.

    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:3:p:767-783. 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.