IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v23y2020i1d10.1007_s10951-019-00631-9.html
   My bibliography  Save this article

Approximation algorithms for the twin robot scheduling problem

Author

Listed:
  • Florian Jaehn

    (Helmut-Schmidt-University)

  • Andreas Wiehl

Abstract

We consider the $$\mathscr {NP}$$NP-hard twin robot scheduling problem, which was introduced by Erdoğan et al. (Naval Res Logist (NRL) 61(2):119–130, 2014). Here, two moving robots positioned at the opposite ends of a rail have to perform automated storage and retrieval jobs at given positions along the gantry rail with a non-crossing constraint. The objective is to minimize the makespan. We extend the original problem by considering pickup and delivery times and present exact and approximation algorithms with a performance ratio of $$\approx \,1.1716$$≈1.1716 for large instances. Further, we compare the presented algorithms in a comprehensive numerical study.

Suggested Citation

  • Florian Jaehn & Andreas Wiehl, 2020. "Approximation algorithms for the twin robot scheduling problem," Journal of Scheduling, Springer, vol. 23(1), pages 117-133, February.
  • Handle: RePEc:spr:jsched:v:23:y:2020:i:1:d:10.1007_s10951-019-00631-9
    DOI: 10.1007/s10951-019-00631-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-019-00631-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10951-019-00631-9?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.

    References listed on IDEAS

    as
    1. Kress, Dominik & Dornseifer, Jan & Jaehn, Florian, 2019. "An exact solution approach for scheduling cooperative gantry cranes," European Journal of Operational Research, Elsevier, vol. 273(1), pages 82-101.
    2. Briskorn, Dirk & Emde, Simon & Boysen, Nils, 2016. "Cooperative twin-crane scheduling," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 109733, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    3. Ehleiter, Anne & Jaehn, Florian, 2016. "Housekeeping: Foresightful container repositioning," International Journal of Production Economics, Elsevier, vol. 179(C), pages 203-211.
    4. Güneş Erdoğan & Maria Battarra & Gilbert Laporte, 2014. "Scheduling twin robots on a line," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(2), pages 119-130, March.
    5. Briskorn, Dirk & Emde, Simon & Boysen, Nils, 2016. "Cooperative twin-crane scheduling," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 80780, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    6. Boysen, Nils & Briskorn, Dirk & Meisel, Frank, 2017. "A generalized classification scheme for crane scheduling with interference," European Journal of Operational Research, Elsevier, vol. 258(1), pages 343-357.
    7. Nils Boysen & Dirk Briskorn & Simon Emde, 2015. "A decomposition heuristic for the twin robots scheduling problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(1), pages 16-22, February.
    8. Kap Hwan Kim & Ki Young Kim, 1999. "An Optimal Routing Algorithm for a Transfer Crane in Port Container Terminals," Transportation Science, INFORMS, vol. 33(1), pages 17-33, February.
    9. H. W. Kuhn, 1955. "The Hungarian method for the assignment problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 2(1‐2), pages 83-97, March.
    10. Dirk Briskorn & Florian Jaehn & Andreas Wiehl, 2019. "A generator for test instances of scheduling problems concerning cranes in transshipment terminals," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(1), pages 45-69, March.
    11. Roodbergen, Kees Jan & Vis, Iris F.A., 2009. "A survey of literature on automated storage and retrieval systems," European Journal of Operational Research, Elsevier, vol. 194(2), pages 343-362, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lennart Zey & Dirk Briskorn & Nils Boysen, 2022. "Twin-crane scheduling during seaside workload peaks with a dedicated handshake area," Journal of Scheduling, Springer, vol. 25(1), pages 3-34, February.
    2. Dirk Briskorn & Florian Jaehn & Andreas Wiehl, 2019. "A generator for test instances of scheduling problems concerning cranes in transshipment terminals," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(1), pages 45-69, March.
    3. Amelie Eilken, 2019. "A decomposition-based approach to the scheduling of identical automated yard cranes at container terminals," Journal of Scheduling, Springer, vol. 22(5), pages 517-541, October.
    4. Gharehgozli, Amir & Yu, Yugang & de Koster, René & Du, Shaofu, 2019. "Sequencing storage and retrieval requests in a container block with multiple open locations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 125(C), pages 261-284.
    5. Dirk Briskorn, 2021. "Routing two stacking cranes with predetermined container sequences," Journal of Scheduling, Springer, vol. 24(4), pages 367-380, August.
    6. Wang, Mengyao & Zhou, Chenhao & Wang, Aihu, 2022. "A cluster-based yard template design integrated with yard crane deployment using a placement heuristic," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 160(C).
    7. Kress, Dominik & Dornseifer, Jan & Jaehn, Florian, 2019. "An exact solution approach for scheduling cooperative gantry cranes," European Journal of Operational Research, Elsevier, vol. 273(1), pages 82-101.
    8. Damla Kizilay & Deniz Türsel Eliiyi, 2021. "A comprehensive review of quay crane scheduling, yard operations and integrations thereof in container terminals," Flexible Services and Manufacturing Journal, Springer, vol. 33(1), pages 1-42, March.
    9. Chen, Ran & Yang, Jingjing & Yu, Yugang & Guo, Xiaolong, 2023. "Retrieval request scheduling in a shuttle-based storage and retrieval system with two lifts," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 174(C).
    10. Gharehgozli, Amir & Zaerpour, Nima, 2018. "Stacking outbound barge containers in an automated deep-sea terminal," European Journal of Operational Research, Elsevier, vol. 267(3), pages 977-995.
    11. Shell Ying Huang & Ya Li, 2017. "Yard crane scheduling to minimize total weighted vessel loading time in container terminals," Flexible Services and Manufacturing Journal, Springer, vol. 29(3), pages 689-720, December.
    12. Anne Ehleiter & Florian Jaehn, 2018. "Scheduling crossover cranes at container terminals during seaside peak times," Journal of Heuristics, Springer, vol. 24(6), pages 899-932, December.
    13. Ehleiter, Anne & Jaehn, Florian, 2016. "Housekeeping: Foresightful container repositioning," International Journal of Production Economics, Elsevier, vol. 179(C), pages 203-211.
    14. Caldeira dos Santos, Murillo & Pereira, Fábio Henrique, 2021. "Development and application of a dynamic model for road port access and its impacts on port-city relationship indicators," Journal of Transport Geography, Elsevier, vol. 96(C).
    15. Gharehgozli, Amir Hossein & Vernooij, Floris Gerardus & Zaerpour, Nima, 2017. "A simulation study of the performance of twin automated stacking cranes at a seaport container terminal," European Journal of Operational Research, Elsevier, vol. 261(1), pages 108-128.
    16. Dirk Briskorn & Lennart Zey, 2020. "Interference aware scheduling of triple-crossover-cranes," Journal of Scheduling, Springer, vol. 23(4), pages 465-485, August.
    17. Amir Gharehgozli & Debjit Roy & Suruchika Saini & Jan-Kees Ommeren, 2023. "Loading and unloading trains at the landside of container terminals," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 25(3), pages 549-575, September.
    18. Gharehgozli, Amir & Zaerpour, Nima, 2020. "Robot scheduling for pod retrieval in a robotic mobile fulfillment system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    19. Vallada, Eva & Belenguer, Jose Manuel & Villa, Fulgencia & Alvarez-Valdes, Ramon, 2023. "Models and algorithms for a yard crane scheduling problem in container ports," European Journal of Operational Research, Elsevier, vol. 309(2), pages 910-924.
    20. Amir Hossein Gharehgozli & Yugang Yu & Xiandong Zhang & René de Koster, 2017. "Polynomial Time Algorithms to Minimize Total Travel Time in a Two-Depot Automated Storage/Retrieval System," Transportation Science, INFORMS, vol. 51(1), pages 19-33, February.

    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:spr:jsched:v:23:y:2020:i:1:d:10.1007_s10951-019-00631-9. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.