Integration of Berth Allocation and Crane Assignment to Improve the Resource Utilization at a Seaport Container Terminal

1. Daganzo C F (1989) The crane scheduling problem, Transportation Research B 23/3: 159–175

   Article  MathSciNet  Google Scholar 

2. Guan Y, Cheung R K (2004) The berth allocation problem: models and solution methods, OR Spectrum 26: 75–92

   Article  MATH  MathSciNet  Google Scholar 

3. Imai A, Sun X, Nishimura E, Papadimitriou S (2005) Berth allocation in a container port: using a continuous location space approach, Transportation Research B 39: 199–221

   Article  Google Scholar 

4. Kim K H, Moon K C (2003) Berth scheduling by simulated annealing, Transportation Research B 37: 541–560

   Article  Google Scholar 

5. Neumann K, Zimmermann J (2000) Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints, European Journal of Operational Research 127: 425–443

   Article  MATH  Google Scholar 

6. Park Y M, Kim K H (2003) A scheduling method for berth and quay cranes, OR Spectrum 25: 1–23

   Article  MATH  Google Scholar 

7. Steenken D, Voß S, Stahlbock R (2004) Container terminal operation and operations research — a classification and literature review, OR Spectrum 26: 3–49

   Article  MATH  Google Scholar 

8. Vis I F A, de Koster R (2003) Transshipment of containers at a container terminal: an overview, European Journal of Operational Research 147: 1–16

   Article  MATH  Google Scholar 

Download references