IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v61y2014i2p119-130.html
   My bibliography  Save this article

Scheduling twin robots on a line

Author

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

Abstract

This article introduces the twin robots scheduling problem (TRSP), in which two robots positioned at the opposite ends of a rail are required to deliver items to positions along the rail, and the objective is to minimize the makespan. A proof of ‐hardness of the TRSP is presented, along with exact and heuristic algorithms. Computational results on challenging instances are provided.Copyright © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 119–130, 2014

Suggested Citation

  • 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.
    • Handle: RePEc:wly:navres:v:61:y:2014:i:2:p:119-130
    DOI: 10.1002/nav.21570
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.21570
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.21570?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
    ---><---

    References listed on IDEAS

    as
    1. Boysen, Nils & Emde, Simon & Fliedner, Malte, 2012. "Determining crane areas for balancing workload among interfering and noninterfering cranes," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 79437, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    2. Nils Boysen & Simon Emde & Malte Fliedner, 2012. "Determining crane areas for balancing workload among interfering and noninterfering cranes," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(8), pages 656-662, December.
    3. Ng, W. C., 2005. "Crane scheduling in container yards with inter-crane interference," European Journal of Operational Research, Elsevier, vol. 164(1), pages 64-78, July.
    4. Patrick Jaillet & Michael R. Wagner, 2008. "Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses," Operations Research, INFORMS, vol. 56(3), pages 745-757, June.
    5. Andrew Lim & Brian Rodrigues & Fei Xiao & Yi Zhu, 2004. "Crane scheduling with spatial constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(3), pages 386-406, April.
    6. Frank Meisel, 2011. "The quay crane scheduling problem with time windows," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(7), pages 619-636, October.
    7. Wilbert E. Wilhelm, 1987. "Complexity of sequencing tasks in assembly cells attended by one or two robots," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(5), pages 721-738, October.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. 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).
    2. 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.
    3. Florian Jaehn & Andreas Wiehl, 2020. "Approximation algorithms for the twin robot scheduling problem," Journal of Scheduling, Springer, vol. 23(1), pages 117-133, February.
    4. Mathias A. Klapp & Alan L. Erera & Alejandro Toriello, 2018. "The One-Dimensional Dynamic Dispatch Waves Problem," Transportation Science, INFORMS, vol. 52(2), pages 402-415, March.
    5. Yildiz, Baris & Savelsbergh, Martin, 2020. "Pricing for delivery time flexibility," Transportation Research Part B: Methodological, Elsevier, vol. 133(C), pages 230-256.

    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. 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.
    2. Simon Emde, 2017. "Optimally scheduling interfering and non‐interfering cranes," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(6), pages 476-489, September.
    3. Schulz, Arne & Fliedner, Malte & Fiedrich, Benedikt & Pfeiffer, Christian, 2021. "Levelling crane workload in multi-yard rail-road container terminals," European Journal of Operational Research, Elsevier, vol. 293(3), pages 941-954.
    4. 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.
    5. 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.
    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. Shoufeng Ma & Hongming Li & Ning Zhu & Chenyi Fu, 2021. "Stochastic programming approach for unidirectional quay crane scheduling problem with uncertainty," Journal of Scheduling, Springer, vol. 24(2), pages 137-174, April.
    8. Gang Ren & Xiaohan Wang & Jiaxin Cai & Shujuan Guo, 2021. "Allocation and Scheduling of Handling Resources in the Railway Container Terminal Based on Crossing Crane Area," Sustainability, MDPI, vol. 13(3), pages 1-24, January.
    9. Wen, Charlie & Eksioglu, Sandra Duni & Greenwood, Allen & Zhang, Shu, 2010. "Crane scheduling in a shipbuilding environment," International Journal of Production Economics, Elsevier, vol. 124(1), pages 40-50, March.
    10. Cong Chen & Huili Zhang & Yinfeng Xu, 2022. "Online machine minimization with lookahead," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1149-1172, July.
    11. Ehleiter, Anne & Jaehn, Florian, 2016. "Housekeeping: Foresightful container repositioning," International Journal of Production Economics, Elsevier, vol. 179(C), pages 203-211.
    12. Robenek, Tomáš & Umang, Nitish & Bierlaire, Michel & Ropke, Stefan, 2014. "A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports," European Journal of Operational Research, Elsevier, vol. 235(2), pages 399-411.
    13. Zhang, Huili & Tong, Weitian & Lin, Guohui & Xu, Yinfeng, 2019. "Online minimum latency problem with edge uncertainty," European Journal of Operational Research, Elsevier, vol. 273(2), pages 418-429.
    14. Xu, Jun & Wang, Jun-Qiang & Liu, Zhixin, 2022. "Parallel batch scheduling: Impact of increasing machine capacity," Omega, Elsevier, vol. 108(C).
    15. Sumin Chen & Qingcheng Zeng & Yushan Hu, 2022. "Scheduling optimization for two crossover automated stacking cranes considering relocation," Operational Research, Springer, vol. 22(3), pages 2099-2120, July.
    16. Ananya Christman & William Forcier & Aayam Poudel, 2018. "From theory to practice: maximizing revenues for on-line dial-a-ride," Journal of Combinatorial Optimization, Springer, vol. 35(2), pages 512-529, February.
    17. Thomas Kalinowski & Reena Kapoor & Martin W. P. Savelsbergh, 2017. "Scheduling reclaimers serving a stock pad at a coal terminal," Journal of Scheduling, Springer, vol. 20(1), pages 85-101, February.
    18. Devansh Jalota & Dario Paccagnan & Maximilian Schiffer & Marco Pavone, 2023. "Online Routing Over Parallel Networks: Deterministic Limits and Data-driven Enhancements," INFORMS Journal on Computing, INFORMS, vol. 35(3), pages 560-577, May.
    19. Wen, Jian & Nassir, Neema & Zhao, Jinhua, 2019. "Value of demand information in autonomous mobility-on-demand systems," Transportation Research Part A: Policy and Practice, Elsevier, vol. 121(C), pages 346-359.
    20. Xu Cheng & Lixin Tang & Panos Pardalos, 2015. "A Branch-and-Cut algorithm for factory crane scheduling problem," Journal of Global Optimization, Springer, vol. 63(4), pages 729-755, December.

    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:wly:navres:v:61:y:2014:i:2:p:119-130. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.