메뉴 건너뛰기
Journal of Intelligent Manufacturing
Volumn 22, Issue 3, 2011, Pages 459-470
A quay crane scheduling algorithm considering the workload of yard cranes in a container yard
Author keywords

Congestion; Container terminals; Quay cranes; Scheduling
Indexed keywords

CONGESTION; CONTAINER TERMINAL; CONTAINER YARD; EXPECTED DELAY; HIGH PRODUCTIVITY; META-HEURISTIC SEARCH ALGORITHMS; NUMERICAL EXPERIMENTS; QUAY CRANE SCHEDULING; QUAY CRANES; STORAGE YARDS; VESSEL OPERATIONS; YARD CRANES;
EID: 79958855303     PISSN: 09565515     EISSN: 15728145     Source Type: Journal    
DOI: 10.1007/s10845-009-0303-9     Document Type: Conference Paper
Times cited : (25)
References (10)
  • 1
    • 0024686408 scopus 로고
    • Crane scheduling problem
    • DOI 10.1016/0191-2615(89)90001-5
    • C. F. Daganzo 1989 The crane scheduling problem Transportation Research Part B: Methodological 23 159 175 10.1016/0191-2615(89)90001-5 (Pubitemid 20647287)
    • (1989) Transportation Research Part B: Methodological , vol.23 B , Issue.3 , pp. 159-175
    • Daganzo Carlos, F.1
  • 2
    • 0000049494 scopus 로고
    • Greedy randomized adaptive search procedures
    • 10.1007/BF01096763
    • T. A. Feo M. G. C. Resende 1995 Greedy randomized adaptive search procedures Journal of Global Optimization 6 109 133 10.1007/BF01096763
    • (1995) Journal of Global Optimization , vol.6 , pp. 109-133
    • Feo, T.A.1    Resende, M.G.C.2
  • 3
    • 1642618965 scopus 로고    scopus 로고
    • A crane scheduling method for port container terminals
    • 10.1016/S0377-2217(03)00133-4
    • K. H. Kim Y. M. Park 2004 A crane scheduling method for port container terminals European Journal of Operational Research 156 752 768 10.1016/S0377-2217(03)00133-4
    • (2004) European Journal of Operational Research , vol.156 , pp. 752-768
    • Kim, K.H.1    Park, Y.M.2
  • 4
    • 34948884022 scopus 로고    scopus 로고
    • Quay crane scheduling with non-interference constraints in port container terminals
    • DOI 10.1016/j.tre.2006.08.001, PII S1366554506000846
    • D.-H. Lee H. Q. Wang L. Miao 2008 Quay crane scheduling with non-interference constraints in port container terminals Transportation Research Part E 44 124 135 10.1016/j.tre.2006.08.001 (Pubitemid 47528130)
    • (2008) Transportation Research Part E: Logistics and Transportation Review , vol.44 , Issue.1 , pp. 124-135
    • Lee, D.-H.1    Wang, H.Q.2    Miao, L.3
  • 5
    • 33746338246 scopus 로고    scopus 로고
    • On-line parameter estimation for a partially observable system subject to random failure
    • DOI 10.1002/nav.20156
    • J. Lin Y. Wan L. Wang 2006 Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures Naval Research Logistics 53 60 74 10.1002/nav.20156 (Pubitemid 44117542)
    • (2006) Naval Research Logistics , vol.53 , Issue.5 , pp. 477-483
    • Lin, D.1    Makis, V.2
  • 6
    • 33645693040 scopus 로고    scopus 로고
    • A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
    • 10.1002/nav.20121
    • L. Moccia J.-F. Cordeau M. Gaudioso G. Laporte 2006 A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal Naval Research Logistics 53 45 59 10.1002/nav.20121
    • (2006) Naval Research Logistics , vol.53 , pp. 45-59
    • Moccia, L.1    Cordeau, J.-F.2    Gaudioso, M.3    Laporte, G.4
  • 7
    • 0025436513 scopus 로고
    • A branch and bound solution method for the crane scheduling problem
    • 10.1016/0191-2615(90)90014-P
    • R. I. Peterkofsky C. F. Daganzo 1990 A branch and bound solution method for the crane scheduling problem Transportation Research Part B: Methodological 24 159 172 10.1016/0191-2615(90)90014-P
    • (1990) Transportation Research Part B: Methodological , vol.24 , pp. 159-172
    • Peterkofsky, R.I.1    Daganzo, C.F.2
  • 8
    • 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 M. F. Monaco 2007 A tabu search heuristic for the quay crane scheduling problem Journal of Scheduling 10 327 336 10.1007/s10951-007-0029-5 (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
  • 9
    • 59049093348 scopus 로고    scopus 로고
    • An efficient algorithm for solving a new mathematical model for a quay crane scheduling problem in container ports
    • 10.1016/j.cie.2008.05.011
    • R. Tavakkoli-Moghaddam A. Makui S. Salahi M. Bazzazi F. Taheri 2009 An efficient algorithm for solving a new mathematical model for a quay crane scheduling problem in container ports Computers & Industrial Engineering 56 241 248 10.1016/j.cie.2008.05.011
    • (2009) Computers & Industrial Engineering , vol.56 , pp. 241-248
    • Tavakkoli-Moghaddam, R.1    Makui, A.2    Salahi, S.3    Bazzazi, M.4    Taheri, F.5
  • 10
    • 33751071819 scopus 로고    scopus 로고
    • Crane scheduling with non-crossing constraint
    • DOI 10.1057/palgrave.jors.2602110, PII 2602110
    • Y. Zhu A. Lim 2006 Crane scheduling with non-crossing constraint Journal of the Operational Research Society 57 1464 1471 10.1057/palgrave.jors.2602110 (Pubitemid 44771083)
    • (2006) Journal of the Operational Research Society , vol.57 , Issue.12 , pp. 1464-1471
    • Zhu, Y.1    Lim, A.2

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