A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules

4OR

Volumn 12, Issue 2, 2014, Pages 123-156

  Legato, Pasquale ^a   Trunfio, Roberto ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

Branch bound; Local branching; Scheduling; Unidirectional schedules

Indexed keywords

EID: 84901476853     PISSN: 16194500     EISSN: 16142411     Source Type: Journal    
DOI: 10.1007/s10288-013-0235-2     Document Type: Article

References (24)

1. Bierwirth C, Meisel F (2009) A fast heuristic for quay crane scheduling with interference constraints. J Sched 12: 345-360.
2. 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.
3. Daganzo C (1989) The crane scheduling problem. Transp Res B 23(3): 159-175.
4. Dell'Amico M, Martello S (1995) Optimal scheduling of tasks on identical parallel processors. ORSA J Comput 7: 181-200.
5. Fischetti M, Lodi A (2003) Local branching. Math Prog B 98(1-3): 23-47.
6. Guan Y, Yang KH, Zhou Z (2010) The crane scheduling problem: models and solution approaches. Ann Oper Res 203(1): 119-139.
7. Haouari M, Gharbi A, Jemmali M (2006) Tight bounds for the identical parallel machine scheduling problem. Int Trans Oper Res 13: 529-548.
8. Kim K, Park Y (2004) A crane scheduling method for port container terminals. Eur J Oper Res 156: 752-768.
9. Lee D, Chen J (2010) An improved approach for quay crane scheduling with non-crossing constraints. Eng Optimiz 42(1): 1-15.
10. Lee DH, Wang HQ, Miao L (2008) Quay crane scheduling with non-interference constraints in port container terminals. Transp Res E 44(1): 124-135.
11. Legato P, Mazza R, Trunfio R (2010) Simulation-based optimization for discharge/loading operations at a maritime container terminal. OR Spect 32(3): 543-567.
12. Legato P, Trunfio R, Meisel F (2012) Modeling and solving rich quay crane scheduling problems. Comput Oper Res 39: 2063-2078.
13. Lim A, Rodrigues B, Xiao F, Zhu Y (2004) Crane scheduling with spatial constraints. Nav Res Log 51(3): 386-406.
14. Lim A, Rodrigues B, Xu Z (2007) A m-parallel crane scheduling problem with a non-crossing constraint. Nav Res Log 54(2): 115-127.
15. Liu J, Wan YW, Wang L (2006) Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures. Nav Res Log 53(1): 60-74.
16. Meisel F (2011) The quay crane scheduling problem with time windows. Nav Res Log 58(7): 619-636.
17. Meisel F, Bierwirth C (2011) A unified approach for the evaluation of quay crane scheduling models and algorithms. Comput Oper Res 38(3): 683-693.
18. Moccia L, Cordeau JF, Gaudioso M, Laporte G (2006) A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal. Nav Res Log 53: 45-59.
19. Monaco M, Sammarra M (2011) Quay crane scheduling with time windows, one-way and spatial constraints. Int J Shipp Transp Logist 3(4): 454-474.
20. Ng WC, Mak KL (2006) Quay crane scheduling in container terminals. Eng Opt 38(6): 723-737.
21. Peterkofsky R, Daganzo C (1990) Branch-and-bound solution method for the crane scheduling problem. Transp Res B 24(1): 159-172.
22. Sammarra M, Cordeau JF, Laporte G, Monaco MF (2007) A tabu search heuristic for the quay crane scheduling problem. J Sched 10: 327-336.
23. Stahlbock R, Voß S (2008) Operations research at container terminals: a literature update. OR Spect 30: 1-52.
24. Zhu Y, Lim A (2006) Crane scheduling with non-crossing constraint. J Oper Res Soc 57(12): 1464-1471.