Discrete time model and algorithms for container yard crane scheduling

European Journal of Operational Research

Volumn 198, Issue 1, 2009, Pages 165-172

  Li, Wenkai ^a   Wu, Yong ^a   Petering, M E H ^a   Goh, Mark ^a   Souza, Robert de ^a  

^a Logistics Institute   (Singapore)

Author keywords

Container yard; MILP; Rolling horizon algorithm; Scheduling

Indexed keywords

CONTAINERS; PERMANENT MAGNETS; SCHEDULING; SHIP CRANES;

CONTAINER TERMINALS; CONTAINER YARD; DECISION VARIABLES; DISCRETE-TIME MODELS; INTEGER VARIABLES; MILP; OPERATIONAL CONSTRAINTS; OPTIMAL SOLUTIONS; PRIME MOVERS; SEPARATION DISTANCES; SOLUTION QUALITIES; SOLUTION TIME; SPACE CONSTRAINTS; TIME WINDOWS; WAITING-TIME; YARD CRANES;

SCHEDULING ALGORITHMS;

EID: 62749136033     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2008.08.019     Document Type: Article

References (20)

1. Bish E.K. A multiple-crane-constrained scheduling problem in a container terminal. European Journal of Operational Research 144 (2003) 83-107
2. Chen L., Bostel N., Dejax P., Cai J., and Xi L. A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal. European Journal of Operational Research 181 (2007) 40-58
3. Cheung R.K., Li C., and Lin W. Interblock crane deployment in container terminals. Transportation Science 36 (2002) 79-93
4. Froyland G., Koch T., Megow N., Duane E., and Wren H. Optimizing the landside operation of a container terminal. OR Spectrum 30 (2008) 53-75
5. Henwood R., 2006. The practitioner's definitive guide: Seafreight forwarding, SNP Reference.
6. Hopp W.J., and Spearman M.L. Factory Physics: Foundations of Manufacturing Management (2000), Irwin/McGraw-Hill
7. Kim K.H., and Kim K.Y. An optimal routing algorithm for a transfer crane in port container terminals. Transportation Science 33 (1999) 17-33
8. Kim K.Y., and Kim K.H. Heuristic algorithms for routing yard-side equipment for minimizing loading times in container terminals. Naval Research Logistics 50 (2003) 498-514
9. Kim K.H., and Park Y. A crane scheduling method for port container terminals. European Journal of Operational Research 156 (2004) 752-768
10. Li J., Leung S., Wu Y., and Liu K. Allocation of empty containers between multi-ports. European Journal of Operational Research 182 (2007) 400-412
11. Lim A., Rodrigues B., and Xu Z. A m-parallel crane scheduling problem with a non-crossing constraint. Naval Research Logistics 54 (2007) 115-127
12. Narasimhan A., and Palekar U.S. Analysis and algorithms for the transtainer routing problem in container port operations. Transportation Science 36 (2002) 63-78
13. Ng W.C. Crane scheduling in container yards with inter-crane interference. European Journal of Operational Research 164 (2005) 64-78
14. Ng W.C., and Mak K.L. Yard crane scheduling in port container terminals. Applied Mathematical Modelling 29 (2005) 263-275
15. Ng, W.C., Tsang, W.S., 2005. Scheduling yard crane in a port container terminal using genetic algorithm. In: The First International Conference on Transportation Logistics (T-Log 2005) 27-29 July, Singapore.
16. Stahlbock R., and Voß S. Operations research at container terminals: A literature update. OR Spectrum 30 (2008) 1-52
17. Steenken D., Voß S., and Stahlbock R. Container terminal operation and operations research - a classification and literature review. OR Spectrum 26 (2004) 3-49
18. Vis I.F.A., and Koster R.D. Transshipment of containers at a container terminal: An overview. European Journal of Operational Research 147 (2003) 1-16
19. Wang F., and Lim A. A stochastic beam search for the berth allocation problem. Decision Support Systems 42 (2007) 2186-2196
20. Zhang C., Wan Y., Liu J., and Linn R.J. Dynamic crane deployment in container storage yards. Transportation Research B 36 (2002) 537-555