메뉴 건너뛰기




Volumn 39, Issue 9, 2012, Pages 2063-2078

Modeling and solving rich quay crane scheduling problems

Author keywords

Container terminal; Quay crane scheduling; Timed Petri Net

Indexed keywords

BENCH-MARK PROBLEMS; BRANCH AND BOUNDS; CONTAINER TERMINAL; DUE DATES; HIGH-QUALITY SOLUTIONS; LOAD OPERATIONS; LOWER BOUNDS; MARITIME CONTAINER TERMINAL; NUMERICAL EXPERIMENTS; PLANNING PROBLEM; PRECEDENCE RELATIONS; QUAY CRANE SCHEDULING; QUAY CRANES; REAL-WORLD PROBLEM; RUNTIMES; SAFETY REQUIREMENTS; SERVICE RATES; SOLUTION METHODS; TIMED PETRI NET;

EID: 84855532149     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2011.09.025     Document Type: Article
Times cited : (111)

References (24)
  • 2
    • 17444364075 scopus 로고    scopus 로고
    • Container terminal operation and operations research - A classification and literature review
    • DOI 10.1007/s00291-003-0157-z
    • D. Steenken, S. Voß, and R. Stahlbock Container terminal operation and operations research - a classification and literature review OR Spectrum 26 2004 3 49 (Pubitemid 40549578)
    • (2004) OR Spectrum , vol.26 , Issue.1 , pp. 3-49
    • Steenken, D.1    Voss, S.2    Stahlbock, R.3
  • 3
    • 36248971841 scopus 로고    scopus 로고
    • Operations research at container terminals: A literature update
    • R. Stahlbock, and S. Voß Operations research at container terminals: a literature update OR Spectrum 30 2008 1 52
    • (2008) OR Spectrum , vol.30 , pp. 1-52
    • Stahlbock, R.1    Voß, S.2
  • 4
    • 70350568773 scopus 로고    scopus 로고
    • A survey of berth allocation and quay crane scheduling problems in container terminals
    • C. Bierwirth, and F. Meisel A survey of berth allocation and quay crane scheduling problems in container terminals European Journal of Operational Research 202 3 2010 615 627
    • (2010) European Journal of Operational Research , vol.202 , Issue.3 , pp. 615-627
    • Bierwirth, C.1    Meisel, F.2
  • 6
    • 33645678746 scopus 로고    scopus 로고
    • Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
    • J. Liu, Y.-W. Wan, and L. Wang Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures Naval Research Logistics 53 1 2005 60 74
    • (2005) Naval Research Logistics , vol.53 , Issue.1 , pp. 60-74
    • Liu, J.1    Wan, Y.-W.2    Wang, L.3
  • 8
    • 33751071819 scopus 로고    scopus 로고
    • Crane scheduling with non-crossing constraint
    • DOI 10.1057/palgrave.jors.2602110, PII 2602110
    • Y. Zhu, and A. Lim Crane scheduling with non-crossing constraint Journal of the Operational Research Society 57 12 2006 1464 1471 (Pubitemid 44771083)
    • (2006) Journal of the Operational Research Society , vol.57 , Issue.12 , pp. 1464-1471
    • Zhu, Y.1    Lim, A.2
  • 9
    • 33847695719 scopus 로고    scopus 로고
    • A m-parallel crane scheduling problem with a non-crossing constraint
    • DOI 10.1002/nav.20189
    • A. Lim, B. Rodrigues, and Z. Xu A m-parallel crane scheduling problem with a non-crossing constraint Naval Research Logistics 54 2 2007 115 127 (Pubitemid 46383203)
    • (2007) Naval Research Logistics , vol.54 , Issue.2 , pp. 115-127
    • Lim, A.1    Rodrigues, B.2    Xu, Z.3
  • 10
    • 33745586759 scopus 로고    scopus 로고
    • Quay crane scheduling in container terminals
    • DOI 10.1080/03052150600691038, PII H575056282370719
    • W.C. Ng, and K.L. Mak Quay crane scheduling in container terminals Engineering Optimization 38 6 2006 723 737 (Pubitemid 43982685)
    • (2006) Engineering Optimization , vol.38 , Issue.6 , pp. 723-737
    • Ng, W.C.1    Mak, K.L.2
  • 11
    • 84896315052 scopus 로고    scopus 로고
    • The crane scheduling problem: Models and solution approaches
    • Y. Guan, K.-H. Yang, and Z. Zhou The crane scheduling problem: models and solution approaches Annals of Operations Research 2010 1 21
    • (2010) Annals of Operations Research , pp. 1-21
    • Guan, Y.1    Yang, K.-H.2    Zhou, Z.3
  • 12
    • 80052282564 scopus 로고    scopus 로고
    • The quay crane scheduling problem with time windows
    • F. Meisel The quay crane scheduling problem with time windows Naval Research Logistics 58 7 2011 619 636
    • (2011) Naval Research Logistics , vol.58 , Issue.7 , pp. 619-636
    • Meisel, F.1
  • 13
    • 77953537858 scopus 로고    scopus 로고
    • Simulation-based optimization for discharge/loading operations at a maritime container terminal
    • P. Legato, R. Mazza, and R. Trunfio Simulation-based optimization for discharge/loading operations at a maritime container terminal OR Spectrum 32 2010 543 567
    • (2010) OR Spectrum , vol.32 , pp. 543-567
    • Legato, P.1    Mazza, R.2    Trunfio, R.3
  • 14
    • 82555197053 scopus 로고    scopus 로고
    • Modeling simulation and optimization in logistics
    • 10.1007/s10288-010-0139-3
    • R. Trunfio Modeling simulation and optimization in logistics 4OR: A Quarterly Journal of Operations Research 2010 1 4 10.1007/s10288-010-0139-3
    • (2010) 4OR: A Quarterly Journal of Operations Research , pp. 1-4
    • Trunfio, R.1
  • 15
    • 1642618965 scopus 로고    scopus 로고
    • A crane scheduling method for port container terminals
    • K. Kim, and Y. Park A crane scheduling method for port container terminals European Journal of Operational Research 156 2004 752 768
    • (2004) European Journal of Operational Research , vol.156 , pp. 752-768
    • Kim, K.1    Park, Y.2
  • 16
    • 33645693040 scopus 로고    scopus 로고
    • A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
    • L. Moccia, J.-F. Cordeau, M. Gaudioso, and G. Laporte A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal Naval Research Logistics 53 2006 45 59
    • (2006) Naval Research Logistics , vol.53 , pp. 45-59
    • Moccia, L.1    Cordeau, J.-F.2    Gaudioso, M.3    Laporte, G.4
  • 17
    • 34848836641 scopus 로고    scopus 로고
    • A tabu search heuristic for the quay crane scheduling problem
    • DOI 10.1007/s10951-007-0029-5
    • M. Sammarra, J.-F. Cordeau, G. Laporte, and M.F. Monaco A tabu search heuristic for the quay crane scheduling problem Journal of Scheduling 10 2007 327 336 (Pubitemid 47501054)
    • (2007) Journal of Scheduling , vol.10 , Issue.4-5 , pp. 327-336
    • Sammarra, M.1    Cordeau, J.-F.2    Laporte, G.3    Monaco, M.F.4
  • 18
    • 68249120807 scopus 로고    scopus 로고
    • A fast heuristic for quay crane scheduling with interference constraints
    • C. Bierwirth, and F. Meisel A fast heuristic for quay crane scheduling with interference constraints Journal of Scheduling 12 2009 345 360
    • (2009) Journal of Scheduling , vol.12 , pp. 345-360
    • Bierwirth, C.1    Meisel, F.2
  • 19
    • 59049093348 scopus 로고    scopus 로고
    • An efficient algorithm for solving a new mathematical model for a quay crane scheduling problem in container ports
    • R. Tavakkoli-Moghaddam, A. Makui, S. Salahi, M. Bazzazi, and F. Taheri An efficient algorithm for solving a new mathematical model for a quay crane scheduling problem in container ports Computers & Industrial Engineering 56 1 2009 241 248
    • (2009) Computers & Industrial Engineering , vol.56 , Issue.1 , pp. 241-248
    • Tavakkoli-Moghaddam, R.1    Makui, A.2    Salahi, S.3    Bazzazi, M.4    Taheri, F.5
  • 20
    • 77949280971 scopus 로고    scopus 로고
    • Multiship crane sequencing with yard congestion constraints
    • S. Choo, D. Klabjan, and D. Simchi-Levi Multiship crane sequencing with yard congestion constraints Transportation Science 44 1 2010 98 115
    • (2010) Transportation Science , vol.44 , Issue.1 , pp. 98-115
    • Choo, S.1    Klabjan, D.2    Simchi-Levi, D.3
  • 21
    • 0001679827 scopus 로고    scopus 로고
    • Exact and approximation algorithms for makespan minimization on unrelated parallel machines
    • PII S0166218X9600087X
    • S. Martello, F. Soumis, and P. Toth Exact and approximation algorithms for makespan minimization on unrelated parallel machines Discrete Applied Mathematics 75 1997 169 188 (Pubitemid 127410571)
    • (1997) Discrete Applied Mathematics , vol.75 , Issue.2 , pp. 169-188
    • Martello, S.1    Soumis, F.2    Toth, P.3
  • 22
    • 0000804104 scopus 로고
    • Duality-based algorithms for scheduling unrelated parallel machines
    • S. van de Velde Duality-based algorithms for scheduling unrelated parallel machines ORSA Journal on Computing 5 1993 192 205
    • (1993) ORSA Journal on Computing , vol.5 , pp. 192-205
    • Van De Velde, S.1
  • 23
    • 77957307373 scopus 로고    scopus 로고
    • A unified approach for the evaluation of quay crane scheduling models and algorithms
    • F. Meisel, and C. Bierwirth A unified approach for the evaluation of quay crane scheduling models and algorithms Computers & Operations Research 38 3 2011 683 693
    • (2011) Computers & Operations Research , vol.38 , Issue.3 , pp. 683-693
    • Meisel, F.1    Bierwirth, C.2


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