A fast heuristic for quay crane scheduling with interference constraints

Journal of Scheduling

Volumn 12, Issue 4, 2009, Pages 345-360

  Bierwirth, Christian ^a   Meisel, Frank ^a  

^a MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

Author keywords

Container terminal operations; Disjunctive graph model; Quay crane interference; Unidirectional schedule

Indexed keywords

BRANCH-AND-BOUND ALGORITHMS; CONTAINER TERMINAL; CONTAINER TERMINAL OPERATIONS; DISJUNCTIVE GRAPH MODEL; HEURISTIC SOLUTIONS; INTERFERENCE CONSTRAINTS; OPTIMIZATION MODELS; QUAY CRANE INTERFERENCE; QUAY CRANE SCHEDULING; QUAY CRANES; SEA PORTS; UNIDIRECTIONAL SCHEDULE;

CONTAINERS; CRANES; HEURISTIC ALGORITHMS; HEURISTIC METHODS; RAILROAD YARDS AND TERMINALS;

PORT TERMINALS;

EID: 68249120807     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-009-0105-0     Document Type: Article

References (16)

1. Bierwirth, C., & Meisel, F. (2009). A survey of berth allocation and quay crane scheduling problems in container terminals (Working paper). Martin-Luther-University Halle-Wittenberg, submitted for publication.
2. C. F. Daganzo 1989 The crane scheduling problem Transportation Research Part B 23 3 159 175
3. K. H. Kim Y. M. Park 2004 A crane scheduling method for port container terminals European Journal of Operational Research 156 3 752 768
4. A. Lim B. Rodrigues F. Xiao Y. Zhu 2004 Crane scheduling with spatial constraints Naval Research Logistics 51 3 386 406
5. A. Lim B. Rodrigues Z. Xu 2007 A m-parallel crane scheduling problem with a non-crossing constraint Naval Research Logistics 54 2 115 127 (Pubitemid 46383203)
6. J. Liu Y.-W. Wan L. Wang 2006 Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures Naval Research Logistics 53 1 60 74
7. Meersmans, P. J. M., & Dekker, R. (2001). Operations research supports container handling (Econometric Institute Report 234). Erasmus University Rotterdam.
8. L. Moccia J.-F. Cordeau M. Gaudioso G. Laporte 2006 A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal Naval Research Logistics 53 1 45 59
9. R. I. Peterkofsky C. F. Daganzo 1990 A branch and bound solution method for the crane scheduling problem Transportation Research Part B 24 3 159 172
10. Pinedo, M. (2002). Scheduling-theory, algorithms, and systems (2nd ed.). Englewood Cliffs: Prentice Hall.
11. M. Sammarra J.-F. Cordeau G. Laporte M. F. Monaco 2007 A tabu search heuristic for the quay crane scheduling problem Journal of Scheduling 10 4-5 327 336 (Pubitemid 47501054)
12. R. Stahlbock S. Voß 2008 Operations research at container terminals: a literature update OR Spectrum 30 1 1 52
13. Steenken, D., Winter, T., & Zimmermann, U. T. (2001). Stowage and transport optimization in ship planning. In M. Grötschel, S. Krumke, & J. Rambau (Eds.), Online optimization of large scale systems (pp. 731-745). Berlin: Springer.
14. I. F. A. Vis R. de Koster 2003 Transshipment of containers at a container terminal: an overview European Journal of Operational Research 147 1 1 16
15. Winter, T. (1999). Online and real-time dispatching problems. PhD thesis, Technical University Braunschweig.
16. Y. Zhu A. Lim 2006 Crane scheduling with non-crossing constraint Journal of the Operational Research Society 57 12 1464 1471 (Pubitemid 44771083)