Scheduling algorithms for mobile harbor: An extended m-parallel machine problem

International Journal of Industrial Engineering : Theory Applications and Practice

Volumn 20, Issue 1-2, 2013, Pages 211-224

  Sung, I ^a   Nam, H ^a   Lee, T ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

CONTAINERS; FLEET OPERATIONS; GENETIC ALGORITHMS; HEURISTIC METHODS; INTEGER PROGRAMMING; SCHEDULING; SHIPS;

CONTAINER LOADING; FLOATING STRUCTURES; HEURISTIC APPROACH; MIXED INTEGER PROGRAMMING (MIP); NEAR-OPTIMAL SOLUTIONS; OPERATIONS SCHEDULING; PARALLEL MACHINE PROBLEMS; SUM OF COMPLETION TIME;

PORTS AND HARBORS;

EID: 84879175119     PISSN: 10724761     EISSN: 1943670X     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (16)

1. Bierwirth, C., Meisel, F. (2009), A fast heuristic for quay crane scheduling with interference constraints, Journal of Scheduling, 12: 345-360
2. Bierwirth, C., Meisel, F. (2010), A survey of berth allocation and quay crane scheduling problems in container terminals, European Journal of Operational Research, 202:615-627.
3. Chae, JW., Park, WS., Yi, JH., Jeong, G. (2007), A floating mobile quay for a very large container ship, Asian and Pacific Coasts.
4. Daganzo, C. F. (1989), The crane scheduling problem, Transportation Research Part B,23:159-175.
5. Jin, GG. (2000), Genetic Algorithms and Their Applications, KyoWooSa, Korea.
6. Kim, KH., Park, YM. (2004), A crane scheduling method for port container terminals, European Journal of Operational Research, 156: 752-768.
7. Lee, D.-H., Wang, H. Q., Miao, L. (2008), Quay crane scheduling with non-interference constraints in port container terminals, Transportation Research Part E, 44: 124-135.
8. Lim, A., Rodrigues, B., Xu, Z. (2004), Approximation schemes for the crane scheduling problem, In T. Hagerup and J. Katajainen, editors, 9th Scandinavian Workshop on Algorithm Theory (SWAT 2004), volume 3111 of LNCS, pages 323-335, Berlin et al., Springer.
9. Lim, A., Rodrigues, B., Xu, Z. (2007), A m-parallel crane scheduling problem with a non-crossing constraint, Naval Research Logistics, 54:115-127.
10. Liu, J., Wan, Y.-W., Wang, L. (2006), Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures, Naval Research Logistics, 53:60-74.
11. Moccia, L., Cordeau, J. F., Gaudioso, M., Laporte, G. (2006), A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal, Naval Research Logistics, 53: 45-59.
12. Moon, BR. (2008), Genetic Algorithms for beginners. Hanbit media, Korea.
13. Peterkofsky, R. I., Daganzo, C. F. (1990), A branch and bound solution method for the crane scheduling problem, Transportation Research Part B, 24:159-172.
14. Sammarra, M., Cordeau, J. F., Laporte, G., Monaco, M. F. (2007), A tabu search heuristic for the quay crane scheduling problem, Journal of Scheduling, 10: 327-336.
15. Tavakkoli-Moghaddam, R., Makui. A., Salahi, S., Bazzazi, M., Taheri, F. (2008), An efficient algorithm for solving a new mathematical model for a quay crane scheduling problem in container ports, Computers & Industrial Engineering, 56: 241-248.
16. Zhu, Y., Lim, A. (2006), Crane scheduling with non-crossing constraint, Journal of the Operational Research Society, 57:1464-1471.