On double cycling for container port productivity improvement

Annals of Operations Research

Volumn 243, Issue 1-2, 2016, Pages 55-70

  Ku, Dusan ^a   Arthanari, Tiru S ^a  

^a UNIVERSITY OF AUCKLAND BUSINESS SCHOOL   (New Zealand)

Author keywords

Container terminal; Double cycling; Quay crane scheduling

Indexed keywords

EID: 84901728087     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-014-1645-z     Document Type: Article

References (17)

1. Avriel, M., Penn, M., Shpirer, N., & Witteboon, S. (1998). Stowage planning for container ships to reduce the number of shifts. Annals of Operations Research, 76, 55–71.
2. Bierwirth, C., & Meisel, F. (2009). A fast heuristic for quay crane scheduling with interference constraints. Journal of Scheduling, 12(4), 345–360.
3. Bierwirth, C., & Meisel, F. (2010). A survey of berth allocation and quay crane scheduling problems in container terminals. European Journal of Operational Research, 202(3), 615–627.
4. Feo, T., & Resende, M. (1995). Greedy randomized adaptive search procedures. Journal of Global Optimization, 6(2), 109–133.
5. Gadeyne, B., & Verhamme, P. (2011). Optimizing maritime container terminal operations. Master’s thesis, Ghent University, Belgium.
6. Glover, F. (1989). Tabu search-part i. ORSA Journal on Computing, 1(3), 190–206.
7. Goodchild, A. (2005). Crane double cycling in container ports: algorithms, evaluation, and planning. PhD thesis, University of California, Berkeley.
8. Goodchild, A., & Daganzo, C. (2004). Reducing ship turn-around time using double-cycling. Institute of Transportation Studies, University of California, Berkeley.
9. Goodchild, A., & Daganzo, C. (2006). Double-cycling strategies for container ships and their effect on ship loading and unloading operations. Transportation Science, 40(4), 473–483.
10. He, X., Wang, S., & Zheng, J. (2011). A hybrid heuristic algorithm for integrated large-capacity quay crane scheduling problem. In Computer Research and Development (ICCRD), 2011 3rd international conference on, IEEE, vol. 1, pp. 309–312.
11. Johnson, S. (1954). Optimal two-and three-stage production schedules with setup times included. Naval Research Logistics Quarterly, 1(1), 61–68.
12. Kim, K., & Park, Y. (2004). A crane scheduling method for port container terminals. European Journal of Operational Research, 156(3), 752–768.
13. Moccia, L., Cordeau, J., Gaudioso, M., & Laporte, G. (2006). A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal. Naval Research Logistics (NRL), 53(1), 45–59.
14. Sammarra, M., Cordeau, J., Laporte, G., & Monaco, M. (2007). A tabu search heuristic for the quay crane scheduling problem. Journal of Scheduling, 10(4), 327–336.
15. Song, J. (2007). A study for optimization of double cycling in container ports. Port Technology International, 36, 50–52.
16. Wang, D., Li, X., & Wang, Q. (2011). A two-stage composite heuristic for dual cycling quay crane scheduling problem. In Systems, Man, and Cybernetics (SMC), 2011 IEEE international conference on, IEEE, pp. 1902–1907.
17. Zhang, H., & Kim, K. (2009). Maximizing the number of dual-cycle operations of quay cranes in container terminals. Computers & Industrial Engineering, 56(3), 979–992.