메뉴 건너뛰기




Volumn 232, Issue 1, 2014, Pages 198-208

An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem

Author keywords

(S) Scheduling Port container terminal; Mathematical formulation; Unidirectional quay crane scheduling problem

Indexed keywords

CONTAINER TERMINAL; CONTAINER TERMINAL MANAGEMENT; MATHEMATICAL FORMULATION; QUAY CRANE SCHEDULING; SCHEDULING PROBLEM; SEARCHING ALGORITHMS; STANDARD OPTIMIZATION; STATE-OF-THE-ART ALGORITHMS;

EID: 84882895700     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2013.06.051     Document Type: Article
Times cited : (60)

References (18)
  • 1
    • 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 4 2009 345 360
    • (2009) Journal of Scheduling , vol.12 , Issue.4 , pp. 345-360
    • Bierwirth, C.1    Meisel, F.2
  • 3
    • 1642618965 scopus 로고    scopus 로고
    • A crane scheduling method for port container terminals
    • K.H. Kim, and Y.M. Park A crane scheduling method for port container terminals European Journal of Operational Research 156 3 2004 752 768
    • (2004) European Journal of Operational Research , vol.156 , Issue.3 , pp. 752-768
    • Kim, K.H.1    Park, Y.M.2
  • 4
    • 77951130205 scopus 로고    scopus 로고
    • An improved approach for quay crane scheduling with non-crossing constraints
    • D.H. Lee, and J.H. Chen An improved approach for quay crane scheduling with non-crossing constraints Engineering Optimization 42 1 2010 1 15
    • (2010) Engineering Optimization , vol.42 , Issue.1 , pp. 1-15
    • Lee, D.H.1    Chen, J.H.2
  • 6
    • 84855532149 scopus 로고    scopus 로고
    • Modeling and solving rich quay crane scheduling problems
    • P. Legato, R. Trunfio, and F. Meisel Modeling and solving rich quay crane scheduling problems Computers and Operations Research 39 9 2012 2063 2078
    • (2012) Computers and Operations Research , vol.39 , Issue.9 , pp. 2063-2078
    • Legato, P.1    Trunfio, R.2    Meisel, F.3
  • 8
    • 35048904113 scopus 로고    scopus 로고
    • Approximation schemes for the crane scheduling problem
    • T. Hagerup, J. Katajainen, Springer
    • A. Lim, B. Rodrigues, and Z. Xu Approximation schemes for the crane scheduling problem T. Hagerup, J. Katajainen, 9th Scandinavian workshop on algorithm theory 2004 Springer 323 335
    • (2004) 9th Scandinavian Workshop on Algorithm Theory , pp. 323-335
    • Lim, A.1    Rodrigues, B.2    Xu, Z.3
  • 9
    • 33847695719 scopus 로고    scopus 로고
    • A m-parallel crane scheduling problem with a non-crossing constraint
    • 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
    • (2007) Naval Research Logistics , vol.54 , Issue.2 , pp. 115-127
    • Lim, A.1    Rodrigues, B.2    Xu, Z.3
  • 10
    • 33645678746 scopus 로고    scopus 로고
    • Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
    • J. Liu, Y. Wan, and L. Wang Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures Naval Research Logistics 53 1 2006 60 74
    • (2006) Naval Research Logistics , vol.53 , Issue.1 , pp. 60-74
    • Liu, J.1    Wan, Y.2    Wang, L.3
  • 11
    • 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
  • 12
    • 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 and Operations Research 38 3 2011 683 693
    • (2011) Computers and Operations Research , vol.38 , Issue.3 , pp. 683-693
    • Meisel, F.1    Bierwirth, C.2
  • 13
    • 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 1 2006 45 59
    • (2006) Naval Research Logistics , vol.53 , Issue.1 , pp. 45-59
    • Moccia, L.1    Cordeau, J.F.2    Gaudioso, M.3    Laporte, G.4
  • 15
    • 33745586759 scopus 로고    scopus 로고
    • Quay crane scheduling in container terminals
    • W.C. Ng, and K.L. Mak Quay crane scheduling in container terminals Engineering Optimization 38 6 2006 723 737
    • (2006) Engineering Optimization , vol.38 , Issue.6 , pp. 723-737
    • Ng, W.C.1    Mak, K.L.2
  • 17
    • 34848836641 scopus 로고    scopus 로고
    • A tabu search heuristic for the quay crane scheduling problem
    • M. Sammarra, J. Cordeau, G. Laporte, and M. Monaco A tabu search heuristic for the quay crane scheduling problem Journal of Scheduling 10 4 2007 327 336
    • (2007) Journal of Scheduling , vol.10 , Issue.4 , pp. 327-336
    • Sammarra, M.1    Cordeau, J.2    Laporte, G.3    Monaco, M.4
  • 18
    • 33751071819 scopus 로고    scopus 로고
    • Crane scheduling with non-crossing constraint
    • Y. Zhu, and A. Lim Crane scheduling with non-crossing constraint Journal of the Operational Research Society 57 12 2006 1464 1471
    • (2006) Journal of the Operational Research Society , vol.57 , Issue.12 , pp. 1464-1471
    • Zhu, Y.1    Lim, A.2


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