메뉴 건너뛰기




Volumn 49, Issue 4, 2015, Pages 957-967

Optimal algorithm for the general Quay crane double-cycling problem

Author keywords

Container ports; Double cycling; Quay cranes; Scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONTAINERS; CRANES; HATCH COVERS; HATCHES; MACHINE SHOP PRACTICE; PORT TERMINALS; PORTS AND HARBORS; SCHEDULING;

EID: 84946077447     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.2014.0563     Document Type: Article
Times cited : (49)

References (29)
  • 1
    • 68249120807 scopus 로고    scopus 로고
    • A fast heuristic for quay crane scheduling with interference constraints
    • Bierwirth C, Meisel F (2009) A fast heuristic for quay crane scheduling with interference constraints. J. Scheduling 12(4):345-360.
    • (2009) J. Scheduling , vol.12 , Issue.4 , pp. 345-360
    • Bierwirth, C.1    Meisel, F.2
  • 2
    • 70350568773 scopus 로고    scopus 로고
    • A survey of berth allocation and quay crane scheduling problems in container terminals
    • Bierwirth C, Meisel F (2010) A survey of berth allocation and quay crane scheduling problems in container terminals. Eur. J. Oper. Res. 202(3):615-627.
    • (2010) Eur. J. Oper. Res. , vol.202 , Issue.3 , pp. 615-627
    • Bierwirth, C.1    Meisel, F.2
  • 4
    • 77949280971 scopus 로고    scopus 로고
    • Multiship crane sequencing with yard congestion constraints
    • Choo S, Klabjan D, Simchi-Levi D (2010) Multiship crane sequencing with yard congestion constraints. Transportation Sci. 44(1):98-115.
    • (2010) Transportation Sci. , vol.44 , Issue.1 , pp. 98-115
    • Choo, S.1    Klabjan, D.2    Simchi-Levi, D.3
  • 5
    • 28244441388 scopus 로고    scopus 로고
    • Models and tabu search heuristics for the berth-allocation problem
    • Cordeau J-F, Laporte G, Legato P, Moccia L (2005) Models and tabu search heuristics for the berth-allocation problem. Transportation Sci. 39(4):526-538.
    • (2005) Transportation Sci. , vol.39 , Issue.4 , pp. 526-538
    • Cordeau, J.-F.1    Laporte, G.2    Legato, P.3    Moccia, L.4
  • 6
    • 0024924579 scopus 로고
    • Crane productivity and ship delay in ports
    • Daganzo CF (1989) Crane productivity and ship delay in ports. Transportation Res. Record 1251:1-9.
    • (1989) Transportation Res. Record , vol.1251 , pp. 1-9
    • Daganzo, C.F.1
  • 7
    • 33751017964 scopus 로고    scopus 로고
    • Double-cycling strategies for container ships and their effect on ship loading and unloading operations
    • Goodchild AV, Daganzo CF (2006) Double-cycling strategies for container ships and their effect on ship loading and unloading operations. Transportation Sci. 40(4):473-483.
    • (2006) Transportation Sci. , vol.40 , Issue.4 , pp. 473-483
    • Goodchild, A.V.1    Daganzo, C.F.2
  • 8
    • 34250626149 scopus 로고    scopus 로고
    • Crane double cycling in container ports: Planning methods and evaluation
    • Goodchild AV, Daganzo CF (2007) Crane double cycling in container ports: Planning methods and evaluation. Transportation Res. Part B 41(8):875-891.
    • (2007) Transportation Res. Part B , vol.41 , Issue.8 , pp. 875-891
    • Goodchild, A.V.1    Daganzo, C.F.2
  • 10
    • 28244459676 scopus 로고    scopus 로고
    • Multiobjective simultaneous stowage and load planning for a container ship with container rehandle in yard stacks
    • Imai A, Sasaki K, Nishimura E, Papadimitriou S (2006) Multiobjective simultaneous stowage and load planning for a container ship with container rehandle in yard stacks. Eur. J. Oper. Res. 171(2):373-389.
    • (2006) Eur. J. Oper. Res. , vol.171 , Issue.2 , pp. 373-389
    • Imai, A.1    Sasaki, K.2    Nishimura, E.3    Papadimitriou, S.4
  • 11
    • 0003075019 scopus 로고
    • Optimal two and three-stage production schedules with setup times included
    • Johnson SM (1954) Optimal two and three-stage production schedules with setup times included. Naval Res. Logist. 1(1):61-68.
    • (1954) Naval Res. Logist. , vol.1 , Issue.1 , pp. 61-68
    • Johnson, S.M.1
  • 12
    • 0002767793 scopus 로고    scopus 로고
    • An optimal routing algorithm for a transfer crane in port container terminals
    • Kim KH, Kim KY (1999) An optimal routing algorithm for a transfer crane in port container terminals. Transportation Sci. 33(1):17-33.
    • (1999) Transportation Sci. , vol.33 , Issue.1 , pp. 17-33
    • Kim, K.H.1    Kim, K.Y.2
  • 13
    • 1642618965 scopus 로고    scopus 로고
    • A crane scheduling method for port container terminals
    • Kim KH, Park Y-M (2004) A crane scheduling method for port container terminals. Eur. J. Oper. Res. 156(3):752-768.
    • (2004) Eur. J. Oper. Res. , vol.156 , Issue.3 , pp. 752-768
    • Kim, K.H.1    Park, Y.-M.2
  • 14
    • 17444425276 scopus 로고    scopus 로고
    • A beam search algorithm for the load sequencing of outbound containers in port container terminals
    • Kim KH, Kang JS, Ryu KR (2004) A beam search algorithm for the load sequencing of outbound containers in port container terminals. OR Spectrum 26(1):93-116.
    • (2004) OR Spectrum , vol.26 , Issue.1 , pp. 93-116
    • Kim, K.H.1    Kang, J.S.2    Ryu, K.R.3
  • 15
    • 34948884022 scopus 로고    scopus 로고
    • Quay crane scheduling with non-interference constraints in port container terminals
    • Lee DH, Wang HQ, Miao L (2008) Quay crane scheduling with non-interference constraints in port container terminals. Transportation Res. Part E 44(1):124-135.
    • (2008) Transportation Res. Part E , vol.44 , Issue.1 , pp. 124-135
    • Lee, D.H.1    Wang, H.Q.2    Miao, L.3
  • 16
    • 0346545785 scopus 로고    scopus 로고
    • The berth planning problem
    • Lim A (1998) The berth planning problem. Oper. Res. Lett. 22(2-3):105-110.
    • (1998) Oper. Res. Lett. , vol.22 , Issue.2-3 , pp. 105-110
    • Lim, A.1
  • 17
    • 33746218426 scopus 로고    scopus 로고
    • A critical-shaking neighborhood search for the yard allocation problem
    • Lim A, Xu Z (2006) A critical-shaking neighborhood search for the yard allocation problem. Eur. J. Oper. Res. 174(2):1247-1259.
    • (2006) Eur. J. Oper. Res. , vol.174 , Issue.2 , pp. 1247-1259
    • Lim, A.1    Xu, Z.2
  • 18
    • 33847695719 scopus 로고    scopus 로고
    • A m-parallel crane scheduling problem with a non-crossing constraint
    • Lim A, Rodrigues B, Xu Z (2007) A m-parallel crane scheduling problem with a non-crossing constraint. Naval Res. Logist. 54(2):115-127.
    • (2007) Naval Res. Logist. , vol.54 , Issue.2 , pp. 115-127
    • Lim, A.1    Rodrigues, B.2    Xu, Z.3
  • 19
    • 84877934672 scopus 로고    scopus 로고
    • A framework for integrated berth allocation and crane operations planning in seaport container terminals
    • Meisel F, Bierwirth C (2013) A framework for integrated berth allocation and crane operations planning in seaport container terminals. Transportation Sci. 47(2):131-147.
    • (2013) Transportation Sci. , vol.47 , Issue.2 , pp. 131-147
    • Meisel, F.1    Bierwirth, C.2
  • 20
    • 77953540653 scopus 로고    scopus 로고
    • Container sequencing for quay cranes with internal reshuffles
    • Meisel F, Wichmann M (2010) Container sequencing for quay cranes with internal reshuffles. OR Spectrum 32(3):569-591.
    • (2010) OR Spectrum , vol.32 , Issue.3 , pp. 569-591
    • Meisel, F.1    Wichmann, M.2
  • 21
    • 0019035345 scopus 로고
    • Sequencing to minimize the maximum job cost
    • Monma CL (1980) Sequencing to minimize the maximum job cost. Oper. Res. 28(4):942-951.
    • (1980) Oper. Res. , vol.28 , Issue.4 , pp. 942-951
    • Monma, C.L.1
  • 22
    • 1342290320 scopus 로고    scopus 로고
    • A scheduling method for berth and quay cranes
    • Park Y-M, Kim KH (2003) A scheduling method for berth and quay cranes. OR Spectrum 25(1):1-23.
    • (2003) OR Spectrum , vol.25 , Issue.1 , pp. 1-23
    • Park, Y.-M.1    Kim, K.H.2
  • 23
    • 0018493260 scopus 로고
    • The two-machine maximum flow time problem with series parallel precedence relations
    • Sidney JB (1979) The two-machine maximum flow time problem with series parallel precedence relations. Oper. Res. 27(4):782-791.
    • (1979) Oper. Res. , vol.27 , Issue.4 , pp. 782-791
    • Sidney, J.B.1
  • 24
    • 36248971841 scopus 로고    scopus 로고
    • Operations research at container terminals: A literature update
    • Stahlbock R, Voß S (2008) Operations research at container terminals: A literature update. OR Spectrum 30(1):1-52.
    • (2008) OR Spectrum , vol.30 , Issue.1 , pp. 1-52
    • Stahlbock, R.1    Voß, S.2
  • 25
    • 17444364075 scopus 로고    scopus 로고
    • Container terminal operation and operations research-A classification and literature review
    • Steenken D, Voß S, Stahlbock R (2004) Container terminal operation and operations research-A classification and literature review. OR Spectrum 26(1):3-49.
    • (2004) OR Spectrum , vol.26 , Issue.1 , pp. 3-49
    • Steenken, D.1    Voß, S.2    Stahlbock, R.3
  • 27
    • 84877952268 scopus 로고    scopus 로고
    • An exact algorithm for the integrated planning of berth allocation and quay crane assignment
    • Vacca I, Salani M, Bierlaire M (2013) An exact algorithm for the integrated planning of berth allocation and quay crane assignment. Transportation Sci. 47(2):148-161.
    • (2013) Transportation Sci. , vol.47 , Issue.2 , pp. 148-161
    • Vacca, I.1    Salani, M.2    Bierlaire, M.3
  • 28
    • 77952484738 scopus 로고    scopus 로고
    • Sequencing two cooperating automated stacking cranes in a container terminal
    • Vis IFA, Carlo HJ (2010) Sequencing two cooperating automated stacking cranes in a container terminal. Transportation Sci. 44(2):169-182.
    • (2010) Transportation Sci. , vol.44 , Issue.2 , pp. 169-182
    • Vis, I.F.A.1    Carlo, H.J.2
  • 29
    • 60549109062 scopus 로고    scopus 로고
    • Maximizing the number of dual-cycle operations of quay cranes in container terminals
    • Zhang HP, Kim KH (2009) Maximizing the number of dual-cycle operations of quay cranes in container terminals. Comput. Indust. Engrg. 56(3):979-992.
    • (2009) Comput. Indust. Engrg. , vol.56 , Issue.3 , pp. 979-992
    • Zhang, H.P.1    Kim, K.H.2


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