Berth and quay crane allocation: A moldable task scheduling model

Journal of the Operational Research Society

Volumn 62, Issue 7, 2011, Pages 1189-1197

  Blazewicz, J ^a   Cheng, T C E ^b   MacHowiak, M ^a   Oguz, C ^c  

^a POZNAN UNIVERSITY OF TECHNOLOGY   (Poland)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^c KOÇ UNIVERSITY   (Turkey)

Author keywords

berth allocation; moldable task; parallel computing; quay crane allocation; resource allocation

Indexed keywords

CRANES; FUNCTIONS; MULTITASKING; PARALLEL PROCESSING SYSTEMS; RESOURCE ALLOCATION; SCHEDULING ALGORITHMS; SHIPS; TRANSFER CASES (VEHICLES);

BERTH ALLOCATION; COMPUTATIONAL EXPERIMENT; COMPUTATIONAL RESULTS; CONTAINER TERMINAL; MOLDABLE TASKS; NONLINEAR FUNCTIONS; QUAY CRANES; SUB-OPTIMAL ALGORITHMS;

PORT TERMINALS;

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

References (34)

1. Blazewicz J, Drabowski M and Weglarz J (1986). Scheduling multiprocessor tasks to minimize schedule length. IEEE Trans Comput 35:389-393. (Pubitemid 16605102)
2. Blazewicz J, Machowiak M, Mounié G and Trystram D (2000). Scheduling malleable tasks with convex processing speed functions. Rev Iberoam de Comp 2:158-165.
3. Blazewicz J, Machowiak M, Mounié G and Trystram D (2001). Approximation algorithm for scheduling independent malleable tasks. Lect Notes Comput Sci 2150:191-197. (Pubitemid 33326542)
4. Blazewicz J, Kovalyov MY, Machowiak M, Trystram D and Weglarz J (2004). Scheduling malleable tasks on parallel processors to minimize the makespan. Ann Opns Res 129:65-80. (Pubitemid 38892375)
5. Cordeau J-F, Laporte G, Legate P and Moccia L (2005). Models and tabu search heuristics for the berth-allocation problem. Transport Sci 39:526-538. (Pubitemid 41706012)
6. Daganzo CF (1989). The crane scheduling problem. Transport Res B 23:159-175.
7. Drozdowski M (2004). Scheduling parallel tasks-Algorithms and complexity. In: Leung JY-T (ed). Handbook of Scheduling: Algorithms, Models, and Performance Analysis, Chapter 25. CRC Press: USA, pp 1-25.
8. Du J and Leung JY-T (1989). Complexity of scheduling parallel tasks systems. SIAM J Discrete Math 2:473-487.
9. Dutot P-F, Mounié G and Trystram D (2004). Scheduling parallel tasks-Approximation algorithms. In: Leung JY-T (ed). Handbook of Scheduling: Algorithms, Models, and Performance Analysis, Chapter 26. CRC Press: USA, pp 1-24.
10. Graham RL (1969). Bounds on multiprocessing timing anomalies. SIAM J Appl Math 17:416-429.
11. Guan Y, Xiao W-Q, Cheung RK and Li C-L (2002). A multiprocessor task scheduling model for berth allocation: Heuristic and worstcase analysis. Opns Res Lett 30:343-350. (Pubitemid 35167682)
12. Hansen P, Oǧuz C and Mladenović N (2008). Variable neighborhood search for minimum cost berth allocation. Eur J Opl Res 191:636-649. (Pubitemid 351778608)
13. Imai A, Nagaiwa K and Tat CW (1997). Efficient planning of berth allocation for container terminals in Asia. J Adv Transport 31:75-94. (Pubitemid 127603112)
14. Imai A, Nishimura E and Papadimitriou S (2001). The dynamic berth allocation problem for a container port. Transport Res B 35:401-417.
15. Imai A, Nishimura E and Papadimitriou S (2003). Berth allocation with service priority. Transport Res B 37:437-457. (Pubitemid 36380812)
16. Imai A, Chen HC, Nishimura E and Papadimitriou S (2008). The simultaneous berth and quay crane allocation problem. Transport Res E 44:900-920.
17. Li C-L, Cai X and Lee C-Y (1998). Scheduling with multiple-job-onone- processor pattern. IIE Trans 30:433-445.
18. Lim A (1998). The berth planning problem. Opns Res Lett 22:105-110. (Pubitemid 128458164)
19. Lim A, Rodrigues B and Xu Z (2007). A m-parallel crane scheduling problem with a non-crossing constraint. Nav Res Log 54:115-127. (Pubitemid 46383203)
20. Liu J, Wan Y-W and Wang L (2006). Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures. Nav Res Log 53:60-74.
21. Lloyd E (1982). Critical path scheduling with resource and processor constraints. J ACM 29:781-811. (Pubitemid 12550117)
22. Ludwig WT (1995). Algorithms for scheduling malleable and nonmalleable parallel tasks. PhD Thesis, Department of Computer Sciences, University of Wisconsin-Madison.
23. Meisel F and Bierwith C (2009). Heuristics for the integration of crane productivity in the berth allocation problem. Transport Res E 45:196-209.
24. Moccia L, Cordeau J-F, Gaudioso M and Laporte G (2006). A branchand-cut algorithm for the quay crane scheduling problem in a container terminal. Nav Res Log 53:45-59.
25. Mounié G, Rapine C and Trystram D (1999). Efficient approximation algorithms for scheduling malleable tasks. In: Miller G and Ramachandran V (eds). Eleventh ACM Symposium on Parallel Algorithms and Architectures (SPAA '99), ACM: USA, pp 23-32.
26. Murty KG, Liu J, Wan Y-W and Linn R (2005). A decision support system for operations in a container terminal. Decis Support Syst 39:309-332.
27. Park KT and Kim KH (2002). Berth scheduling for container terminals by using sub-gradient optimization technique. J Opl Res Soc 53:1054-1062. (Pubitemid 34964231)
28. Park Y-M and Kim KH (2003). A scheduling method for berth and quay cranes. OR Spectrum 25:1-23. (Pubitemid 38260021)
29. Peterkofsky RI and Daganzo CF (1990). A branch-and-bound solution method for the crane scheduling problem. Transport Res B 24:159-172.
30. Sammarra M, Cordeau J-F, Laporte G and Monaco MF (2007). A tabu search heuristic for the quay crane scheduling problem. J Sched 10:327-336. (Pubitemid 47501054)
31. Steenken D, Voss S and Stahlbock R (2004). Container terminal operation and operations research: A classification and literature review. OR SPectrum 26:3-49. (Pubitemid 40549578)
32. Turek J, Wolf J and Yu P (1992). Approximate algorithms for scheduling parallelizable tasks. In: Snyder L (ed). 4th Annual ACM Symposium on Parallel Algorithms and Architectures, ACM: USA, pp 323-332. (Pubitemid 23624546)
33. Vis IFA and de Koster R (2003). Transshipment of containers at a container terminal: An overview. Eur J Opl Res 147:1-16.
34. Weglarz J (1982). Modelling and control of dynamic resource allocation project scheduling systems. In: Tzafestas SG (ed). Optimization and Control of Dynamic Operational Research Models. North-Holland: Amsterdam, pp 105-140.