IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v319y2024i2p468-483.html
   My bibliography  Save this article

Scheduling robotic cells with fixed processing times or time windows: Classification, solution approaches, polynomial algorithms and complexity

Author

Listed:
  • Feng, Jianguang
  • Che, Ada
  • Chu, Chengbin
  • Levner, Eugene
  • Kats, Vladimir

Abstract

Robotic cell scheduling has received considerable attention from researchers. Several existing review papers have presented then-existing studies on robotic cell scheduling and related fields from different perspectives. Since the latest review, numerous new results have emerged, contributing significant advancements in recent years. Furthermore, certain features of these problems have not been appropriately addressed. This paper aims to provide an up-to-date review and present our particular perspectives to address recent publications on scheduling robotic cells with fixed processing times or time windows. First, we identify various characteristics of robotic cell scheduling and explain their impact on the structure and complexity. Based on these characteristics, the related robotic cell scheduling studies are classified and compared in various dimensions. Second, we present complexity results, along with both exact and approximation solution techniques, for the robotic cell scheduling problem with time windows or fixed processing times. These results are presented in tabular forms to visually reveal the relationships between different problem configurations and their respective solution approaches. Finally, we discern emerging trends in the realm of robotic cell scheduling research, subsequently indicating prospective directions for future investigations.

Suggested Citation

  • Feng, Jianguang & Che, Ada & Chu, Chengbin & Levner, Eugene & Kats, Vladimir, 2024. "Scheduling robotic cells with fixed processing times or time windows: Classification, solution approaches, polynomial algorithms and complexity," European Journal of Operational Research, Elsevier, vol. 319(2), pages 468-483.
    • Handle: RePEc:eee:ejores:v:319:y:2024:i:2:p:468-483
    DOI: 10.1016/j.ejor.2024.01.041
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221724000821
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2024.01.041?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:eee:ejores:v:319:y:2024:i:2:p:468-483. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.