메뉴 건너뛰기




Volumn 39, Issue 3-4, 2015, Pages 1194-1201

A lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem

Author keywords

Integer programming; Integrated models; Lagrangian relaxation; Quay crane assignment; Quay crane scheduling

Indexed keywords

COMBINATORIAL OPTIMIZATION; CRANES; INTEGER PROGRAMMING; LAGRANGE MULTIPLIERS; SCHEDULING;

EID: 84919843081     PISSN: 0307904X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apm.2014.07.006     Document Type: Article
Times cited : (61)

References (22)
  • 1
    • 17444364075 scopus 로고    scopus 로고
    • Container terminal operation and operations research - a classification and literature review
    • Voß S., Stahlbock R., Steenken D. Container terminal operation and operations research - a classification and literature review. OR Spectr. 2004, 26(1):3-49.
    • (2004) OR Spectr. , vol.26 , Issue.1 , pp. 3-49
    • Voß, S.1    Stahlbock, R.2    Steenken, D.3
  • 2
    • 84942084967 scopus 로고    scopus 로고
    • The dynamic berth allocation problem: A linearized formulation
    • A. Simrin, A. Diabat, The dynamic berth allocation problem: A linearized formulation, RAIRO Oper. Res. 2014, http://dx.doi.org/10.1051/ro/2014039.
    • (2014) RAIRO Oper. Res
    • Simrin, A.1    Diabat, A.2
  • 3
    • 84903836987 scopus 로고    scopus 로고
    • A multi-vessel quay crane assignment and scheduling problem: Formulation and heuristic solution approach
    • Fu Y.-M., Diabat A., Tsai I.-T. A multi-vessel quay crane assignment and scheduling problem: Formulation and heuristic solution approach. Exp. Sys. Appl. 2014, 41(15).
    • (2014) Exp. Sys. Appl. , vol.41 , Issue.15
    • Fu, Y.-M.1    Diabat, A.2    Tsai, I.-T.3
  • 4
    • 84925535305 scopus 로고    scopus 로고
    • A joint quay crane assignment and scheduling problem: Formulation, solution algorithm, and computational results
    • E. Theodorou, A. Diabat, A joint quay crane assignment and scheduling problem: Formulation, solution algorithm, and computational results, Opt. Lett. 2014, http://dx.doi.org/10.1007/s11590-014-0787-x.
    • (2014) Opt. Lett.
    • Theodorou, E.1    Diabat, A.2
  • 5
    • 0035324677 scopus 로고    scopus 로고
    • The dynamic berth allocation problem for a container port
    • Imai A., Nishimura E., Papadimitriou S. The dynamic berth allocation problem for a container port. Transport. Res. B- Meth. 2001, 35(4):401-417.
    • (2001) Transport. Res. B- Meth. , vol.35 , Issue.4 , pp. 401-417
    • Imai, A.1    Nishimura, E.2    Papadimitriou, S.3
  • 7
    • 34948830996 scopus 로고    scopus 로고
    • Berthing ships at a multi-user container terminal with a limited quay capacity
    • Imai A., Nishimura E., Papadimitriou S. Berthing ships at a multi-user container terminal with a limited quay capacity. Transp. Res. E Logist. Transp. Rev. 2008, 44(1):136-151.
    • (2008) Transp. Res. E Logist. Transp. Rev. , vol.44 , Issue.1 , pp. 136-151
    • Imai, A.1    Nishimura, E.2    Papadimitriou, S.3
  • 9
    • 57149135986 scopus 로고    scopus 로고
    • Heuristics for the integration of crane productivity in the berth allocation problem
    • Meisel F., Bierwirth C. Heuristics for the integration of crane productivity in the berth allocation problem. Transp. Res. E Logist. Transp. Rev. 2009, 45(1):196-209.
    • (2009) Transp. Res. E Logist. Transp. Rev. , vol.45 , Issue.1 , pp. 196-209
    • Meisel, F.1    Bierwirth, C.2
  • 10
    • 0032072364 scopus 로고    scopus 로고
    • Scheduling with multiple-job-on-one-processor pattern
    • Li Chung-Lun, Cai X., Lee C. Scheduling with multiple-job-on-one-processor pattern. IIE Trans. 1998, 30(5):433-445.
    • (1998) IIE Trans. , vol.30 , Issue.5 , pp. 433-445
    • Li, C.-L.1    Cai, X.2    Lee, C.3
  • 11
    • 0036794414 scopus 로고    scopus 로고
    • A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis
    • Guan Y., Xiao W.-Q., Cheung R.K., Li C.-L. A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis. Oper. Res. Lett. 2002, 30(5):343-350.
    • (2002) Oper. Res. Lett. , vol.30 , Issue.5 , pp. 343-350
    • Guan, Y.1    Xiao, W.-Q.2    Cheung, R.K.3    Li, C.-L.4
  • 12
    • 0024686408 scopus 로고
    • The crane scheduling problem
    • Daganzo C.F. The crane scheduling problem. Transp. Res. B Methodol. 1989, 23(3):159-175.
    • (1989) Transp. Res. B Methodol. , vol.23 , Issue.3 , pp. 159-175
    • Daganzo, C.F.1
  • 14
    • 33645678746 scopus 로고    scopus 로고
    • Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
    • Liu J., Wan Y., Wang L. Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures. Nav. Res. Logist. 2006, 53(1):60-74.
    • (2006) Nav. Res. Logist. , vol.53 , Issue.1 , pp. 60-74
    • Liu, J.1    Wan, Y.2    Wang, L.3
  • 15
    • 77949280971 scopus 로고    scopus 로고
    • Multiship crane sequencing with yard congestion constraints
    • Choo S., Klabjan D., Simchi-Levi D. Multiship crane sequencing with yard congestion constraints. Transp. Sci. 2009, 44(1):98-115.
    • (2009) Transp. Sci. , vol.44 , Issue.1 , pp. 98-115
    • Choo, S.1    Klabjan, D.2    Simchi-Levi, D.3
  • 16
    • 33845922411 scopus 로고    scopus 로고
    • A quay crane scheduling method considering interference of yard cranes in container terminals
    • MICAI 2006
    • Park Y., Lee B., Kim K., Ryu K. A quay crane scheduling method considering interference of yard cranes in container terminals. Adv. Artif. 2006, 4293:461-471. MICAI 2006.
    • (2006) Adv. Artif. , vol.4293 , pp. 461-471
    • Park, Y.1    Lee, B.2    Kim, K.3    Ryu, K.4
  • 17
    • 1642618965 scopus 로고    scopus 로고
    • A crane scheduling method for port container terminals
    • Kim K.H., Park Y.-M. A crane scheduling method for port container terminals. Eur. J. Oper. Res. 2004, 156(3):752-768.
    • (2004) Eur. J. Oper. Res. , vol.156 , Issue.3 , pp. 752-768
    • Kim, K.H.1    Park, Y.-M.2
  • 18
    • 68249120807 scopus 로고    scopus 로고
    • A fast heuristic for quay crane scheduling with interference constraints
    • Bierwirth C., Meisel F. A fast heuristic for quay crane scheduling with interference constraints. J. Sched. 2009, 2009(12):345-360.
    • (2009) J. Sched. , vol.2009 , Issue.12 , pp. 345-360
    • Bierwirth, C.1    Meisel, F.2
  • 19
    • 84903836351 scopus 로고    scopus 로고
    • The quay crane scheduling problem with time windows
    • Meisel F. The quay crane scheduling problem with time windows. Nav. Res. Logist. 2011, 53(1):45-59.
    • (2011) Nav. Res. Logist. , vol.53 , Issue.1 , pp. 45-59
    • Meisel, F.1
  • 20
    • 59049093348 scopus 로고    scopus 로고
    • An efficient algorithm for solving a new mathematical model for a quay crane scheduling problem in container ports
    • 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. 2009, 56(1):241-248.
    • (2009) Comput. Ind. Eng. , vol.56 , Issue.1 , pp. 241-248
    • Tavakkoli-Moghaddam, R.1    Makui, A.2    Salahi, S.3    Bazzazi, M.4    Taheri, F.5
  • 21
    • 84902292157 scopus 로고    scopus 로고
    • An integrated quay crane assignment and scheduling problem
    • Diabat A., Theodorou E. An integrated quay crane assignment and scheduling problem. Comput. Ind. Eng. 2014, 73:115-123.
    • (2014) Comput. Ind. Eng. , vol.73 , pp. 115-123
    • Diabat, A.1    Theodorou, E.2
  • 22
    • 0022031091 scopus 로고
    • An applications oriented guide to lagrangian relaxation
    • Fisher M.L. An applications oriented guide to lagrangian relaxation. INFORMS J. Pract. Oper. Res. 1985, 15(2):10-21.
    • (1985) INFORMS J. Pract. Oper. Res. , vol.15 , Issue.2 , pp. 10-21
    • Fisher, M.L.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.