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

Flexible robotic manufacturing cell scheduling problem with multiple robots

Author

Listed:
  • Yujun Yang
  • Ye Chen
  • Chuanze Long

Abstract

By considering the loaded and empty moving tie of robots moving among loading station, machines and unloading station, the flexible robotic manufacturing cell scheduling problem with multiple robots is studied. An improved discrete particle swarm optimisation with genetic operator and random-heuristic initialisation method is created to minimise the makespan. In addition, a multi-robot scheduling strategy is proposed to minimise the displacement operation when inserting the transportation tasks. By exchanging the positions of critical operations, the neighbourhood structure is established to enhance the capacity of the algorithm to local search. After detailed algorithm design and description, we report the results of a computational study that provides evidence that the proposed optimisation-based approach delivers high-quality solutions against the well-known algorithms.

Suggested Citation

  • Yujun Yang & Ye Chen & Chuanze Long, 2016. "Flexible robotic manufacturing cell scheduling problem with multiple robots," International Journal of Production Research, Taylor & Francis Journals, vol. 54(22), pages 6768-6781, November.
    • Handle: RePEc:taf:tprsxx:v:54:y:2016:i:22:p:6768-6781
    DOI: 10.1080/00207543.2016.1176267
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2016.1176267
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2016.1176267?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. Hosseini, Amir & Otto, Alena & Pesch, Erwin, 2024. "Scheduling in manufacturing with transportation: Classification and solution techniques," European Journal of Operational Research, Elsevier, vol. 315(3), pages 821-843.
    2. Fatemi-Anaraki, Soroush & Tavakkoli-Moghaddam, Reza & Foumani, Mehdi & Vahedi-Nouri, Behdin, 2023. "Scheduling of Multi-Robot Job Shop Systems in Dynamic Environments: Mixed-Integer Linear Programming and Constraint Programming Approaches," Omega, Elsevier, vol. 115(C).

    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:54:y:2016:i:22:p:6768-6781. 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.