A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results

Optimization Letters

Volumn 9, Issue 4, 2015, Pages 799-817

  Theodorou, Effrosyni ^a   Diabat, Ali ^a  

^a KHALIFA UNIVERSITY   (United Arab Emirates)

Author keywords

Constraint generation; Container terminals; Lagrangian relaxation; Quay crane assignment; Quay crane scheduling; Restoration technique

Indexed keywords

COMBINATORIAL OPTIMIZATION; CONTAINERS; HEURISTIC METHODS; LAGRANGE MULTIPLIERS; PORT TERMINALS; RESTORATION; SCHEDULING;

CONSTRAINT GENERATION; CONTAINER TERMINAL; LAGRANGIAN RELAXATION; QUAY CRANE SCHEDULING; QUAY CRANES; RESTORATION TECHNIQUES;

CRANES;

EID: 84925535305     PISSN: 18624472     EISSN: 18624480     Source Type: Journal    
DOI: 10.1007/s11590-014-0787-x     Document Type: Article

References (19)

1. Theodorou, E., Diabat, A., Svetinovic, D.: Quay crane sequencing considering productivity, interference and yard congestion constraints. In: IEEE Industrial Engineering and Engineering Management, pp. 1–5 (2012)
2. Simrin, A., Diabat, A.: The dynamic berth allocation problem: a linearized formulation. RAIRO-Oper. Res. doi:10.1051/ro/2014039 (2014) (in press)
3. Meisel, F.: The quay crane scheduling problem with time windows. Nav. Res. Logist. 53(1), 45–59 (2011)
4. Diabat, A., Theodorou, E.: An integrated quay crane assignment and scheduling problem. Comput. Ind. Eng. 73, 115–123 (2014)
5. Bierwirth, C., Meisel, F.: A survey of berth allocation and quay crane scheduling problems in container terminals. Eur. J. Oper. Res. 202(3), 615–627 (2010)
6. Kim, K.H., Park, Y.-M.: A crane scheduling method for port container terminals. Eur. J. Oper. Res. 156(3), 752–768 (2004)
7. Bierwirth, C., Meisel, F.: A fast heuristic for quay crane scheduling with interference constraints. J. Sched. 2009(12), 345–360 (2009)
8. Moccia, L., Cordeau, J.: A branch-$$\cdot $$· and-$$\cdot $$· cut algorithm for the quay crane scheduling problem in a container terminal. Nav. Res. 53(1), 1–37 (2006)
9. Meisel, F., Bierwirth, C.: A framework for integrated berth allocation and crane operations planning in seaport container terminals. Transp. Sci. 47(2), 131–147 (2013)
10. Choo, S., Klabjan, D., Simchi-Levi, D.: Multiship crane sequencing with yard congestion constraints. Transp. Sci. 44(1), 98–115 (2009)
11. Tavakkoli-Moghaddam, R., Makui, a, Salahi, S., Bazzazi, M., Taheri, F.: An efficient algorithm for solving a new mathematical model for a quay crane scheduling problem in container ports. Comput. Ind. Eng. 56(1), 241–248 (2009)
12. Fu, Y.-M., Diabat, A., Tsai, I.-T.: A multi-vessel quay crane assignment and scheduling problem: formulation and heuristic solution approach. Expert Syst. Appl. 41(15), 6959–6965 (2014)
13. Diabat, A., Fu, Y.-M.: A Lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem. Appl. Math. Model. (2014) In press. doi:10.1016/j.apm.2014.07.006
14. Zhang, H., Kim, K.H.: Maximizing the number of dual-cycle operations of quay cranes in container terminals. Comput. Ind. Eng. 56(3), 979–992 (2009)
15. Daganzo, C.F.: The crane scheduling problem. Transp. Res. Part B Methodol. 23(3), 159–175 (1989)
16. Park, Y., Lee, B., Kim, K., Ryu, K.: A quay crane scheduling method considering interference of yard cranes in container terminals. MICAI Adv. Artif. 4293, 461–471 (2006)
17. Guan, Y., Yang, K.-H., Zhou, Z.: The crane scheduling problem: models and solution approaches. Ann. Oper. Res. 203(1), 119–139 (2010)
18. Liu, J., Wan, Y., Wang, L.: Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures. Nav. Res. Logist. 53(1), 60–74 (2006)
19. Fisher, M.L.: An applications oriented guide to Lagrangian relaxation. INFORMS J. Pract. Oper. Res. 15(2), 10–21 (1985)