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

Crane scheduling with spatial constraints

Author

Listed:
  • Andrew Lim
  • Brian Rodrigues
  • Fei Xiao
  • Yi Zhu

Abstract

In this work, we examine port crane scheduling with spatial and separation constraints. Although common to most port operations, these constraints have not been previously studied. We assume that cranes cannot cross, there is a minimum distance between cranes and jobs cannot be done simultaneously. The objective is to find a crane‐to‐job matching which maximizes throughput under these constraints. We provide dynamic programming algorithms, a probabilistic tabu search, and a squeaky wheel optimization heuristic for solution. Experiments show the heuristics perform well compared with optimal solutions obtained by CPLEX for small scale instances where a squeaky wheel optimization with local search approach gives good results within short times. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.

Suggested Citation

  • 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.
    • Handle: RePEc:wly:navres:v:51:y:2004:i:3:p:386-406
    DOI: 10.1002/nav.10123
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.10123
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.10123?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. Hirofumi Matsuo & Jen S. Shang & Robert S. Sullivan, 1991. "A Crane Scheduling Problem in a Computer-Integrated Manufacturing Environment," Management Science, INFORMS, vol. 37(5), pages 587-606, May.
    2. Federico Sabria & Carlos F. Daganzo, 1989. "Approximate Expressions for Queueing Systems with Scheduled Arrivals and Established Service Order," Transportation Science, INFORMS, vol. 23(3), pages 159-165, August.
    3. Daganzo, Carlos F., 1989. "The crane scheduling problem," Transportation Research Part B: Methodological, Elsevier, vol. 23(3), pages 159-175, June.
    4. Peterkofsky, Roy I. & Daganzo, Carlos F., 1990. "A branch and bound solution method for the crane scheduling problem," Transportation Research Part B: Methodological, Elsevier, vol. 24(3), pages 159-172, June.
    5. Ebru K. Bish & Thin‐Yin Leong & Chung‐Lun Li & Jonathan W. C. Ng & David Simchi‐Levi, 2001. "Analysis of a new vehicle scheduling and location problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(5), pages 363-385, August.
    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. 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.
    2. Yiting Xing & Ling Li & Zhuming Bi & Marzena Wilamowska‐Korsak & Li Zhang, 2013. "Operations Research (OR) in Service Industries: A Comprehensive Review," Systems Research and Behavioral Science, Wiley Blackwell, vol. 30(3), pages 300-353, May.
    3. 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.
    4. Sun, Defeng & Tang, Lixin & Baldacci, Roberto, 2019. "A Benders decomposition-based framework for solving quay crane scheduling problems," European Journal of Operational Research, Elsevier, vol. 273(2), pages 504-515.
    5. 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.
    6. Luigi Moccia & Jean‐François Cordeau & Manlio Gaudioso & Gilbert Laporte, 2006. "A branch‐and‐cut algorithm for the quay crane scheduling problem in a container terminal," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(1), pages 45-59, February.
    7. 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.
    8. T. R. Lalita & G. S. R. Murthy, 2022. "Compact ILP formulations for a class of solutions to berth allocation and quay crane scheduling problems," OPSEARCH, Springer;Operational Research Society of India, vol. 59(1), pages 413-439, March.
    9. Branislav Dragović & Nam Kyu Park & Zoran Radmilović, 2006. "Ship-berth link performance evaluation: simulation and analytical approaches," Maritime Policy & Management, Taylor & Francis Journals, vol. 33(3), pages 281-299, July.
    10. Lu Zhen & Shucheng Yu & Shuaian Wang & Zhuo Sun, 2019. "Scheduling quay cranes and yard trucks for unloading operations in container ports," Annals of Operations Research, Springer, vol. 273(1), pages 455-478, February.

    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. Branislav Dragović & Nam Kyu Park & Zoran Radmilović, 2006. "Ship-berth link performance evaluation: simulation and analytical approaches," Maritime Policy & Management, Taylor & Francis Journals, vol. 33(3), pages 281-299, July.
    2. Nabil Nehme & Bacel Maddah & Isam A. Kaysi, 2021. "An integrated multi-ship crane allocation in Beirut Port container terminal," Operational Research, Springer, vol. 21(3), pages 1743-1761, September.
    3. Andrew Lim & Brian Rodrigues & Zhou Xu, 2007. "A m‐parallel crane scheduling problem with a non‐crossing constraint," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(2), pages 115-127, March.
    4. Briskorn, Dirk & Drexl, Andreas & Hartmann, Sönke, 2005. "Inventory based dispatching of automated guided vehicles on container terminals," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 596, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    5. J Blazewicz & T C E Cheng & M Machowiak & C Oguz, 2011. "Berth and quay crane allocation: a moldable task scheduling model," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(7), pages 1189-1197, July.
    6. Zhang, Chuqian & Wan, Yat-wah & Liu, Jiyin & Linn, Richard J., 2002. "Dynamic crane deployment in container storage yards," Transportation Research Part B: Methodological, Elsevier, vol. 36(6), pages 537-555, July.
    7. Evrim Ursavas, 2017. "Crane allocation with stability considerations," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 19(2), pages 379-401, June.
    8. Nils Boysen & Malte Fliedner & Florian Jaehn & Erwin Pesch, 2013. "A Survey on Container Processing in Railway Yards," Transportation Science, INFORMS, vol. 47(3), pages 312-329, August.
    9. 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.
    10. Shawn Choo & Diego Klabjan & David Simchi-Levi, 2010. "Multiship Crane Sequencing with Yard Congestion Constraints," Transportation Science, INFORMS, vol. 44(1), pages 98-115, February.
    11. Kim, Kap Hwan & Park, Young-Man, 2004. "A crane scheduling method for port container terminals," European Journal of Operational Research, Elsevier, vol. 156(3), pages 752-768, August.
    12. Bish, Ebru K., 2003. "A multiple-crane-constrained scheduling problem in a container terminal," European Journal of Operational Research, Elsevier, vol. 144(1), pages 83-107, January.
    13. 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.
    14. Zeng, Qingcheng & Yang, Zhongzhen & Lai, Luyuan, 2009. "Models and algorithms for multi-crane oriented scheduling method in container terminals," Transport Policy, Elsevier, vol. 16(5), pages 271-278, September.
    15. Türkoğulları, Yavuz B. & Taşkın, Z. Caner & Aras, Necati & Altınel, İ. Kuban, 2014. "Optimal berth allocation and time-invariant quay crane assignment in container terminals," European Journal of Operational Research, Elsevier, vol. 235(1), pages 88-101.
    16. 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.
    17. Raymond K. Cheung & Chung-Lun Li & Wuqin Lin, 2002. "Interblock Crane Deployment in Container Terminals," Transportation Science, INFORMS, vol. 36(1), pages 79-93, February.
    18. Kim, Kap Hwan & Moon, Kyung Chan, 2003. "Berth scheduling by simulated annealing," Transportation Research Part B: Methodological, Elsevier, vol. 37(6), pages 541-560, July.
    19. Henry Lau & Ying Zhao, 2008. "Integrated scheduling of handling equipment at automated container terminals," Annals of Operations Research, Springer, vol. 159(1), pages 373-394, March.
    20. Y Zhu & A Lim, 2006. "Crane scheduling with non-crossing constraint," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(12), pages 1464-1471, 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:51:y:2004:i:3:p:386-406. 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.