Heuristics for quay crane scheduling at indented berth

Transportation Research Part E: Logistics and Transportation Review

Volumn 47, Issue 6, 2011, Pages 1005-1020

  Chen, Jiang Hang ^a   Lee, Der Horng ^a   Cao, Jin Xin ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b INNER MONGOLIA UNIVERSITY   (China)

Author keywords

Heuristics; Indented berth; Quay crane scheduling

Indexed keywords

CRANES; INTEGER PROGRAMMING; PORT TERMINALS;

'CURRENT; CONTAINER TERMINAL OPERATION; HEURISTIC; INDENTED BERTH; MIXED INTEGER PROGRAMMING MODEL; PERFORMANCE; QUAY CRANE SCHEDULING; SCHEDULING PROBLEM; SOLUTION DECOMPOSITION; UNIQUE FEATURES;

TABU SEARCH;

CONTAINER TERMINAL; CRANE; HEURISTICS; NUMERICAL MODEL; PORT OPERATION; QUAY;

EID: 79960967280     PISSN: 13665545     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tre.2011.04.004     Document Type: Article

References (14)

1. Bierwirth C., Meisel F. A fast heuristic for quay crane scheduling with interference constraints. Journal of Scheduling 2009, 12(4):345-360.
2. Bierwirth C., Meisel F. A survey of berth allocation and quay crane scheduling problems in container terminals. European Journal of Operational Research 2010, 202(3):615-627.
3. Chae, J.-W., Park, W.-S., Jeong, G., 2008. A hybrid quay wall proposed for a very large container ship in the west terminal of busan new port. In: International Conference on Coastal Engineering in Hamburg, Germany.
4. Chen, J.H., Lee, D.H., Cao, J.X., 2010. Quay crane scheduling for indented berth. In: 89th Transportation Research Board Annual Meeting, Washington, DC, USA.
5. Ghirardi M., Potts C. Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach. European Journal of Operational Research 2005, 165(2):457-467.
6. Hariri A., Potts C. Heuristics for scheduling unrelated parallel machines. Computers & Operations Research 1991, 18(3):323-331.
7. Kim K.H., Park Y.M. A crane scheduling method for port container terminals. European Journal of Operational Research 2004, 156(3):752-768.
8. Lim A. The berth planning problem. Operations Research Letters 1998, 22(2-3):105-110.
9. Lim A., Rodrigues B., Xu Z. Approximation schemes for the crane scheduling problem. 9th Scandinavian Workshop on Algorithm Theory 2004, 323-335. Springer. T. Hagerup, J. Katajainen (Eds.).
10. Moccia L., Cordeau J.F., Gaudioso M., Laporte G. A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal. Naval Research Logistics 2006, 53(1):45-59.
11. Sammarra M., Cordeau J., Laporte G., Monaco M. A tabu search heuristic for the quay crane scheduling problem. Journal of Scheduling 2007, 10(4):327-336.
12. Srivastava B. An effective heuristic for minimising makespan on unrelated parallel machines. Journal of the Operational Research Society 1998, 49(8):886-894.
13. Van de Velde S. Duality-based algorithms for scheduling unrelated parallel machines. ORSA Journal on Computing 1993, 5:192-205.
14. Woodruff D., Zemel E. Hashing vectors for tabu search. Annals of Operations Research 1993, 41(2):123-137.