Optimization of container process at seaport terminals

Journal of the Operational Research Society

Volumn 61, Issue 4, 2010, Pages 658-665

  Wong, A ^a   Kozan, E ^a  

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

Author keywords

Heuristics; Logistics; Scheduling; Sea transport

Indexed keywords

INTERNATIONAL TRADE; LOGISTICS; PORT TERMINALS; PORTS AND HARBORS; SCHEDULING; TABU SEARCH;

CONTAINER TERMINAL; HEURISTICS; NP HARD SCHEDULING PROBLEM; NUMERICAL IMPLEMENTATION; OPERATION EFFICIENCIES; OPERATION PLANNING; SEA TRANSPORT; TABU SEARCH ALGORITHMS;

CONTAINERS;

EID: 77949471669     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2009.18     Document Type: Article

References (20)

1. Bish EK (2003). A multiple-crane-constrained scheduling problem in a container terminal. Eur J Opl Res 144: 83-107.
2. Blazewicz J, Echer KH, Pesch E, Schmidt G and Weglarz J (1996). Scheduling Computer and Manufacturing Processes. Springer: New York.
3. Brucker P (1998). Scheduling Algorithms, 2nd edn. Springer: New York.
4. BTRE (2007). Waterline Issue 42. Bureau of Transport and Regional Economics: Australia. http://www.btre.gov.au/publications/75/files/ wl42.pdf, accessed 17 March 2009.
5. Cordeau JF, Laporte G, Legato P and Moccia L (2005). Models and tabu search heuristics for the berth-allocation problem. Transport Sci 39: 526-538.
6. Glover F and Laguna M (1997). Tabu Search. Kluwer Academic Publishers: London.
7. Grunow M, Günther HO and Lehmann M (2004). Dispatching multiload AGVs in highly automated seaport container terminals. OR Spectrum 26: 211-235.
8. Kim KH and Kim KY (1999). Routing straddle carriers for the loading operation of containers using a beam search algorithm. Comput Indust Eng 36: 109-136.
9. Kozan E (2000). Optimising container transfers at multimodal terminals. Math Comput Model 31: 235-243.
10. Kozan E and Casey B (2007). Alternative algorithms for the optimization of a simulation model of a multimodal container terminal. J Opl Res Soc 58: 1203-1213.
11. Kozan E and Preston P (2006). Mathematical modelling of container transfers and storage locations at seaport terminals. OR Spectrum 28: 519-537.
12. Ng WC, Mak KL and Zhang YX (2007). Scheduling trucks in container terminals using a genetic algorithm. Eng Opt 39(1): 33-47.
13. Ovacik IM and Uzsoy R (1993). Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times. Opns Res Lett 14: 251-256.
14. Papadimitriou CH and Steiglitz K (1998). Combinatorial Optimization: Algorithms and Complexity. Dover Publications: Mineola, NY.
15. Pinedo M (2002). Scheduling: Theory, Algorithms, and Systems, 2nd edn. Prentice Hall: Upper Saddle River, NJ.
16. Schutten JMJ (1996). List scheduling revisited. Opns Res Lett 18: 167-170.
17. Stahlbock R and Voß S (2008). Operations research at container terminals: A literature update. OR Spectrum 30: 1-52.
18. Steenken D, Voß S and Stahlbock R (2004). Container terminal operation and operations research-A classification and literature review. OR Spectrum 26: 3-49.
19. Vairaktarakis G (2004). Flexible hybrid flowshops. In: Leung JY-T (ed). JY-T Handbook of scheduling: algorithms, models and performance analysis. CRC Press: New York, pp 5.1-5.33.
20. Vis I and Koster R (2003). Transshipment of containers at a container terminal: An overview. Eur J Opl Res 147: 1-16.