IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v84y2003i3p283-292.html
   My bibliography  Save this article

Sequencing delivery and receiving operations for yard cranes in port container terminals

Author

Listed:
  • Kim, Kap Hwan
  • Lee, Keung Mo
  • Hwang, Hark

Abstract

No abstract is available for this item.

Suggested Citation

  • Kim, Kap Hwan & Lee, Keung Mo & Hwang, Hark, 2003. "Sequencing delivery and receiving operations for yard cranes in port container terminals," International Journal of Production Economics, Elsevier, vol. 84(3), pages 283-292, June.
    • Handle: RePEc:eee:proeco:v:84:y:2003:i:3:p:283-292
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(02)00466-8
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Clyde L. Monma & Chris N. Potts, 1989. "On the Complexity of Scheduling with Batch Setup Times," Operations Research, INFORMS, vol. 37(5), pages 798-804, October.
    2. Harilaos N. Psaraftis & Marius M. Solomon & Thomas L. Magnanti & Tai-Up Kim, 1990. "Routing and Scheduling on a Shoreline with Release Times," Management Science, INFORMS, vol. 36(2), pages 212-223, February.
    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. Bechir Ben Daya & Jean-François Audy, 2024. "Port Access Fluidity Management during a Major Extension Project: A Simulation-Based Case Study," Sustainability, MDPI, vol. 16(7), pages 1-30, March.
    2. Vis, Iris F.A., 2006. "A comparative analysis of storage and retrieval equipment at a container terminal," International Journal of Production Economics, Elsevier, vol. 103(2), pages 680-693, October.
    3. Li, Wenkai & Goh, Mark & Wu, Yong & Petering, M.E.H. & de Souza, R. & Wu, Y.C., 2012. "A continuous time model for multiple yard crane scheduling with last minute job arrivals," International Journal of Production Economics, Elsevier, vol. 136(2), pages 332-343.
    4. Zhou, Chenhao & Lee, Byung Kwon & Li, Haobin, 2020. "Integrated optimization on yard crane scheduling and vehicle positioning at container yards," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 138(C).
    5. 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.
    6. Yan, Yimo & Chow, Andy H.F. & Ho, Chin Pang & Kuo, Yong-Hong & Wu, Qihao & Ying, Chengshuo, 2022. "Reinforcement learning for logistics and supply chain management: Methodologies, state of the art, and future opportunities," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 162(C).
    7. Iris F. A. Vis & Hector J. Carlo, 2010. "Sequencing Two Cooperating Automated Stacking Cranes in a Container Terminal," Transportation Science, INFORMS, vol. 44(2), pages 169-182, May.
    8. Parola, Francesco & Sciomachen, Anna, 2005. "Intermodal container flows in a port system network:: Analysis of possible growths via simulation models," International Journal of Production Economics, Elsevier, vol. 97(1), pages 75-88, July.
    9. Fotuhi, Fateme & Huynh, Nathan & Vidal, Jose M. & Xie, Yuanchang, 2013. "Modeling yard crane operators as reinforcement learning agents," Research in Transportation Economics, Elsevier, vol. 42(1), pages 3-12.
    10. Ehleiter, Anne & Jaehn, Florian, 2016. "Housekeeping: Foresightful container repositioning," International Journal of Production Economics, Elsevier, vol. 179(C), pages 203-211.
    11. 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.
    12. 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.
    13. Lee, Der-Horng & Cao, Zhi & Meng, Qiang, 2007. "Scheduling of two-transtainer systems for loading outbound containers in port container terminals with simulated annealing algorithm," International Journal of Production Economics, Elsevier, vol. 107(1), pages 115-124, May.
    14. Iris F. A. Vis & Kees Jan Roodbergen, 2009. "Scheduling of Container Storage and Retrieval," Operations Research, INFORMS, vol. 57(2), pages 456-467, April.
    15. Roberto Guerra-Olivares & Neale R. Smith & Rosa G. González-Ramírez & Leopoldo Eduardo Cárdenas-Barrón, 2018. "A study of the sensitivity of sequence stacking strategies for the storage location assignment problem for out-bound containers in a maritime terminal," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(5), pages 1057-1062, October.
    16. Evrim Ursavas, 2022. "Priority control of berth allocation problem in container terminals," Annals of Operations Research, Springer, vol. 317(2), pages 805-824, October.

    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. Stefan Bock, 2016. "Finding optimal tour schedules on transportation paths under extended time window constraints," Journal of Scheduling, Springer, vol. 19(5), pages 527-546, October.
    2. Yuanxiao Wu & Xiwen Lu, 0. "Improved algorithms for single vehicle scheduling on tree/cycle networks," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-16.
    3. Selvarajah, Esaignani & Steiner, George, 2006. "Batch scheduling in a two-level supply chain--a focus on the supplier," European Journal of Operational Research, Elsevier, vol. 173(1), pages 226-240, August.
    4. Liao, C. J. & Yu, W. C., 1996. "Sequencing heuristics for dependent setups in a continuous process industry," Omega, Elsevier, vol. 24(6), pages 649-659, December.
    5. Grundel, Soesja & Çiftçi, Barış & Borm, Peter & Hamers, Herbert, 2013. "Family sequencing and cooperation," European Journal of Operational Research, Elsevier, vol. 226(3), pages 414-424.
    6. Schaller, Jeffrey, 2007. "Scheduling on a single machine with family setups to minimize total tardiness," International Journal of Production Economics, Elsevier, vol. 105(2), pages 329-344, February.
    7. S Karabatı & C Akkan, 2006. "Minimizing sum of completion times on a single machine with sequence-dependent family setup times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(3), pages 271-280, March.
    8. Hao Yan & Peihai Liu & Xiwen Lu, 2023. "Vehicle scheduling problems with two agents on a line," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-18, January.
    9. Zhi-Long Chen, 1997. "Scheduling with batch setup times and earliness-tardiness penalties," European Journal of Operational Research, Elsevier, vol. 96(3), pages 518-537, February.
    10. Kenneth R. Baker, 1999. "Heuristic procedures for scheduling job families with setups and due dates," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(8), pages 978-991, December.
    11. Nils Boysen & Dirk Briskorn & Stefan Schwerdfeger, 2023. "How to charge while driving: scheduling point-to-point deliveries of an electric vehicle under overhead wiring," Journal of Scheduling, Springer, vol. 26(1), pages 19-41, February.
    12. Liaee, Mohammad Mehdi & Emmons, Hamilton, 1997. "Scheduling families of jobs with setup times," International Journal of Production Economics, Elsevier, vol. 51(3), pages 165-176, September.
    13. Joao António Noivo & Helena Ramalhinho-Lourenço, 1998. "Solving two production scheduling problems with sequence-dependent set-up times," Economics Working Papers 338, Department of Economics and Business, Universitat Pompeu Fabra.
    14. Wei Yu & Zhaohui Liu, 2014. "Vehicle routing problems with regular objective functions on a path," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(1), pages 34-43, February.
    15. Bock, Stefan, 2020. "Optimally solving a versatile Traveling Salesman Problem on tree networks with soft due dates and multiple congestion scenarios," European Journal of Operational Research, Elsevier, vol. 283(3), pages 863-882.
    16. repec:dgr:rugsom:95a37 is not listed on IDEAS
    17. Koulamas, Christos & Kyparisis, George J., 2023. "A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems," European Journal of Operational Research, Elsevier, vol. 305(3), pages 999-1017.
    18. Nils Boysen & Dirk Briskorn & Simon Emde, 2018. "Scheduling electric vehicles and locating charging stations on a path," Journal of Scheduling, Springer, vol. 21(1), pages 111-126, February.
    19. Zenker, Michael & Emde, Simon & Boysen, Nils, 2016. "Cyclic inventory routing in a line-shaped network," European Journal of Operational Research, Elsevier, vol. 250(1), pages 164-178.
    20. Dominik Kress & Maksim Barketau & Erwin Pesch, 2018. "Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines," Journal of Scheduling, Springer, vol. 21(6), pages 595-606, December.
    21. Altekin, F. Tevhide & Bukchin, Yossi, 2022. "A multi-objective optimization approach for exploring the cost and makespan trade-off in additive manufacturing," European Journal of Operational Research, Elsevier, vol. 301(1), pages 235-253.

    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:eee:proeco:v:84:y:2003:i:3:p:283-292. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    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.