IDEAS home Printed from https://ideas.repec.org/p/dar/wpaper/80780.html
   My bibliography  Save this paper

Cooperative twin-crane scheduling

Author

Listed:
  • Briskorn, Dirk
  • Emde, Simon
  • Boysen, Nils

Abstract

No abstract is available for this item.

Suggested Citation

  • 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).
    • Handle: RePEc:dar:wpaper:80780
    DOI: 10.1016/j.dam.2016.04.006
    Note: for complete metadata visit http://tubiblio.ulb.tu-darmstadt.de/80780/
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    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. 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.
    3. 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.
    4. 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.
    5. 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.
    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. 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.
    10. 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).
    11. Dirk Briskorn, 2021. "Routing two stacking cranes with predetermined container sequences," Journal of Scheduling, Springer, vol. 24(4), pages 367-380, August.
    12. Ehleiter, Anne & Jaehn, Florian, 2016. "Housekeeping: Foresightful container repositioning," International Journal of Production Economics, Elsevier, vol. 179(C), pages 203-211.
    13. Florian Jaehn & Andreas Wiehl, 2020. "Approximation algorithms for the twin robot scheduling problem," Journal of Scheduling, Springer, vol. 23(1), pages 117-133, February.
    14. 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.
    15. 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.

    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:dar:wpaper:80780. 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: Dekanatssekretariat (email available below). General contact details of provider: https://edirc.repec.org/data/ivthdde.html .

    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.