Container sequencing for quay cranes with internal reshuffles

OR Spectrum

Volumn 32, Issue 3, 2010, Pages 569-591

  Meisel, Frank ^a   Wichmann, Matthias ^b  

^a MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

^b TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

Author keywords

Container sequencing problem; Container terminal; Double cycling; GRASP; Internal reshuffle

Indexed keywords

EID: 77953540653     PISSN: 01716468     EISSN: 14366304     Source Type: Journal    
DOI: 10.1007/s00291-009-0191-6     Document Type: Article

References (26)

1. Ambrosino D, Sciomachen A (2003) Impact of yard organisation on the master bay planning problem. Marit Econ Logist 5(3): 285-300.
2. Ambrosino D, Sciomachen A, Tanfani E (2004) Stowing a containership: the master bay plan problem. Transp Res A 38(2): 81-99.
3. Avriel M, Penn M (1993) Exact and approximate solutions of the container ship stowage problem. Comput Ind Eng 25(1-4): 271-274.
4. Bendall HB, Stent AF (1996) Hatchcoverless container ships: productivity gains from a new technology. Marit Policy Manage 23(2): 187-199.
5. Bierwirth C, Meisel F (2009) A fast heuristic for quay crane scheduling with interference constraints. J Sched 12(4): 345-360.
6. Bierwirth C, Meisel F (2010) A survey of berth allocation and quay crane scheduling problems in container terminals. Eur J Oper Res 202(3): 615-627.
7. Caserta M, Schwarze S, Voß S (2008) A mathematical formulation for the blocks relocation problem. Working paper, University of Hamburg.
8. Chu C-Y, Huang W-C (2002) Aggregates cranes handling capacity of container terminals: the port of kaohsiung. Marit Policy Manage 29(4): 341-350.
9. Daganzo CF (1989) The crane scheduling problem. Transp Res B 23(3): 159-175.
10. Goodchild AV, Daganzo CF (2006) Double-cycling strategies for container ships and their effect on ship loading and unloading operations. Transp Sci 40(4): 473-483.
11. Goodchild AV, Daganzo CF (2007) Crane double cycling in container ports: planning methods and evaluation. Transp Res B 41(8): 875-891.
12. Imai A, Nishimura E, Papadimitriou S, Sasaki K (2002) The containership loading problem. Int J Marit Econ 4(2): 126-148.
13. Imai A, Sasaki K, Nishimura E, Papadimitriou S (2006) Multi-objective simultaneous stowage and load planning for a container ship with container rehandle in yard stacks. Eur J Oper Res 171(2): 373-389.
14. Johnson SM (1954) Optimal two- and three-stage production schedules with setup times. Nav Res Logist Q 1(1): 61-68.
15. Kang J-G, Kim Y-D (2002) Stowage planning in maritime container transportation. J Oper Res Soc 53(4): 415-426.
16. Kim KH, Hong G-P (2006) A heuristic rule for relocating blocks. Comput Oper Res 33(4): 940-954.
17. Kim KH, Kang JS, Ryu KR (2004) A beam search algorithm for the load sequencing of outbound containers in port container terminals. OR Spectr 26(1): 93-116.
18. Kim KH, Park YM (2004) A crane scheduling method for port container terminals. Eur J Oper Res 156(3): 752-768.
19. Lim A, Rodrigues B, Xu Z (2007) A m-parallel crane scheduling problem with a non-crossing constraint. Nav Res Logist 54(2): 115-127.
20. Liu J, Wan Y-W, Wang L (2006) Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures. Nav Res Logist 53(1): 60-74.
21. Moccia L, Cordeau J-F, Gaudioso M, Laporte G (2006) A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal. Nav Res Logist 53(1): 45-59.
22. Resende MGC, Ribeiro CC (2003) Greedy randomized adaptive search procedures. In: Glover F, Kochenberger G (eds) Handbook of Metaheuristics. Kluwer, Dordrecht, pp 219-249.
23. Sammarra M, Cordeau J-F, Laporte G, Monaco MF (2007) A tabu search heuristic for the quay crane scheduling problem. J Sched 10(4-5): 327-336.
24. Stahlbock R, Voß S (2008) Operations research at container terminals: a literature update. OR Spectr 30(1): 1-52.
25. Zhang H, Kim KH (2009) Maximizing the number of dual-cycle operations of quay cranes in container terminals. Comput Indust Eng 56(3): 979-992.
26. Zhu Y, Lim A (2006) Crane scheduling with non-crossing constraint. J Oper Res Soc 57(12): 1464-1471.