메뉴 건너뛰기




Volumn 156, Issue 3, 2004, Pages 752-768

A crane scheduling method for port container terminals

Author keywords

Branch and bound; Combinatorial optimization; Container terminal; Scheduling; Transportation

Indexed keywords

CONTAINERS; CRANES; LOADS (FORCES); OPTIMIZATION; PORTS AND HARBORS; PRODUCTIVITY; SCHEDULING; TRANSPORTATION;

EID: 1642618965     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(03)00133-4     Document Type: Article
Times cited : (436)

References (14)
  • 2
    • 0036474954 scopus 로고    scopus 로고
    • Interblock crane deployment in container terminals
    • Cheung R.K., Li C.-L., Lin W. Interblock crane deployment in container terminals. Transportation Science. 36(1):2002;79-93.
    • (2002) Transportation Science , vol.36 , Issue.1 , pp. 79-93
    • Cheung, R.K.1    Li, C.-L.2    Lin, W.3
  • 4
    • 0010155341 scopus 로고
    • The automatic planning and sequencing of containers for containership loading and unloading
    • Pitkin, Roche, & Williams. North-Holland Publishing Co
    • Cojeen H.P., Dyke P.V. The automatic planning and sequencing of containers for containership loading and unloading. Pitkin, Roche, Williams Ship Operation Automation. 1976;North-Holland Publishing Co.
    • (1976) Ship Operation Automation
    • Cojeen, H.P.1    Dyke, P.V.2
  • 5
    • 0024686408 scopus 로고
    • The crane scheduling problem
    • Daganzo C.F. The crane scheduling problem. Transportation Research Part B. 23B(3):1989;159-175.
    • (1989) Transportation Research Part B , vol.23 B , Issue.3 , pp. 159-175
    • Daganzo, C.F.1
  • 8
    • 0027625565 scopus 로고
    • Scheduling sequence-dependent jobs on identical parallel machines to minimize completion time criteria
    • Guinet A. Scheduling sequence-dependent jobs on identical parallel machines to minimize completion time criteria. International Journal of Production Research. 31(7):1993;1579-1594.
    • (1993) International Journal of Production Research , vol.31 , Issue.7 , pp. 1579-1594
    • Guinet, A.1
  • 9
    • 0002767793 scopus 로고    scopus 로고
    • An optimal routing algorithm for a transfer crane in port container terminals
    • Kim K.H., Kim K.Y. An optimal routing algorithm for a transfer crane in port container terminals. Transportation Science. 33(1):1999;17-33.
    • (1999) Transportation Science , vol.33 , Issue.1 , pp. 17-33
    • Kim, K.H.1    Kim, K.Y.2
  • 10
    • 0000482108 scopus 로고    scopus 로고
    • Scheduling jobs on parallel machines with sequence-dependent setup times
    • Lee Y.H., Pinedo M. Scheduling jobs on parallel machines with sequence-dependent setup times. European Journal of Operational Research. 100(3):1997;464-474.
    • (1997) European Journal of Operational Research , vol.100 , Issue.3 , pp. 464-474
    • Lee, Y.H.1    Pinedo, M.2
  • 11
    • 0346545785 scopus 로고    scopus 로고
    • The berth planning problem
    • Lim A. The berth planning problem. Operations Research Letters. 22:1998;105-110.
    • (1998) Operations Research Letters , vol.22 , pp. 105-110
    • Lim, A.1
  • 12
    • 0036475313 scopus 로고    scopus 로고
    • Analysis and algorithms for the transtainer routing problem in container port operations
    • Narasimhan A., Palekar U.S. Analysis and algorithms for the transtainer routing problem in container port operations. Transportation Science. 36(1):2002;63-78.
    • (2002) Transportation Science , vol.36 , Issue.1 , pp. 63-78
    • Narasimhan, A.1    Palekar, U.S.2
  • 13
    • 0025436513 scopus 로고
    • A branch and bound solution method for the crane scheduling problem
    • Peterkofsky R.I., Daganzo C.F. A branch and bound solution method for the crane scheduling problem. Transportation Research Part B. 24(3):1990;159-172.
    • (1990) Transportation Research Part B , vol.24 , Issue.3 , pp. 159-172
    • Peterkofsky, R.I.1    Daganzo, C.F.2


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