A scheduling method for Berth and Quay cranes

Container Terminals and Automated Transport Systems: Logistics Control Issues and Quantitative Decision Support

Volumn , Issue , 2005, Pages 159-181

  Park, Young Man ^a   Kim, Kap Hwan ^a  

^a Pusan National University   (South Korea)

Author keywords

Berth planning; Container Terminal; Optimization; Scheduling; Transportation

Indexed keywords

EID: 33748664916     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/3-540-26686-0_7     Document Type: Chapter

References (11)

1. Brown GG, Lawphongpanich S, Thurman KP (1995) Optimizing ship Berthing. Naval Research Logistics 41: 1-15
2. Daganzo CF (1989) The crane scheduling problem. Transportation Research 23B (3): 159-175
3. Geoffrion M (1974) Lagrangean relaxation for integer programming. Mathematical Programming Study 2: 82-114
4. Held M, Wolfe P, Crowder HP (1974) Validation of sub-gradient optimization. Mathematical Programming 6: 62-88
5. Imai A, Nishimura E, Papadimitriou S (2001) The dynamic Berth allocation problem for a container port. Transportation Research (Part B) 35: 401-417
6. Lai KK, Shih K (1992) A study of container Berth allocation. Journal of Advanced Transportation 26 (1): 45-60
7. Li C-L, Cai X, Lee C-Y (1998) Scheduling with multiple-job-on-one- processor pattern. IIE Transactions 30: 433-445 (Pubitemid 128728474)
8. Lim (1998) The Berth planning problem. Operation Research Letters 22: 105-110
9. Murty KG (1992) Network programming. Prentice Hall, Englewood Cliffs, NJ
10. Nishimura E, Imai A, Papadimitriou S (2001) Berth allocation planning in the public Berth system by genetic algorithms. European Journal of Operational Research 131: 282-292 (Pubitemid 32271744)
11. Peterkofsky RI, Daganzo CF (1990) A branch and bound solution method for the crane scheduling problem. Transportation Research 24B (3): 159-172