IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v56y2018i1-2p518-542.html
   My bibliography  Save this article

Scheduling twin robots in a palletising problem

Author

Listed:
  • Oliver Thomasson
  • Maria Battarra
  • Güneş Erdoğan
  • Gilbert Laporte

Abstract

This paper introduces the Twin Robot Palletising Problem (TRPP) in which two robots must be scheduled and routed to pick up and deliver products at specified locations along a rail. The robots are initially located at the opposite ends of the rail and must preserve a minimum safe distance from one another. The objective is to minimise the makespan, defined as the time required to complete all operations and for both robots to return to their starting positions. The paper presents a proof of NP-Hardness of the TRPP, as well as two mixed integer linear programming models. Local search operators are introduced, before an iterated local search and an iterated local search and a genetic algorithm are developed, in which a linear-time scheduling algorithm and dynamic programming are utilised to evaluate the quality of solutions. Extensive computational results demonstrate the limits of the mathematical models, the effectiveness of the metaheuristics, and the savings obtained using twin robots instead of a single one.

Suggested Citation

  • Oliver Thomasson & Maria Battarra & Güneş Erdoğan & Gilbert Laporte, 2018. "Scheduling twin robots in a palletising problem," International Journal of Production Research, Taylor & Francis Journals, vol. 56(1-2), pages 518-542, January.
    • Handle: RePEc:taf:tprsxx:v:56:y:2018:i:1-2:p:518-542
    DOI: 10.1080/00207543.2017.1401249
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2017.1401249
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2017.1401249?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:56:y:2018:i:1-2:p:518-542. 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.