메뉴 건너뛰기




Volumn 2196, Issue , 2012, Pages 1298-1301

The influence of the quay crane traveling time for the quay crane scheduling problem

Author keywords

Crane Traveling Time; QCSP; Quay Crane

Indexed keywords

COMPUTER SCIENCE; CONTAINERS; CRANES; LOADING; RAILROAD YARDS AND TERMINALS; RESEARCH; SCHEDULING; SCHEDULING ALGORITHMS; TRUCKS; UNLOADING;

EID: 84867483342     PISSN: 20780958     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (2)

References (11)
  • 1
    • 0024686408 scopus 로고
    • The crane scheduling problem
    • C. F. Daganzo, "The crane scheduling problem", Transportation Research B, 23-3, 1989, pp 159-175.
    • (1989) Transportation Research B , vol.23 , Issue.3 , pp. 159-175
    • Daganzo, C.F.1
  • 2
    • 0025436513 scopus 로고
    • A branch and bound solution method for the crane scheduling problem
    • R. I. Peterkofsky and C. F. Daganzo, "A branch and bound solution method for the crane scheduling problem", Transportation Research B, 24-3, 1990, pp 159-172.
    • (1990) Transportation Research B , vol.24 , Issue.3 , pp. 159-172
    • Peterkofsky, R.I.1    Daganzo, C.F.2
  • 3
    • 34948884022 scopus 로고    scopus 로고
    • Quay crane scheduling with non-interference constraints in port container terminals
    • D. H. Lee, H. Q. Wang, and L. Miao, "Quay crane scheduling with non-interference constraints in port container terminals", Transportation Research E, 44, 2000, pp. 124-135
    • (2000) Transportation Research E , vol.44 , pp. 124-135
    • Lee, D.H.1    Wang, H.Q.2    Miao, L.3
  • 6
    • 33645693040 scopus 로고    scopus 로고
    • A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
    • L. J. Moccia, J. Cordeau, M. Oaudioso, and G. Laporte, "A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal", Naval Research Logistics, 53, 2006, pp. 45-59.
    • (2006) Naval Research Logistics , vol.53 , pp. 45-59
    • Moccia, L.J.1    Cordeau, J.2    Oaudioso, M.3    Laporte, G.4
  • 7
    • 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, pp 1464-1471.
    • (2006) Journal of the Operational Research Society , vol.57 , Issue.12 , pp. 1464-1471
    • Zhu, Y.1    Lim, A.2
  • 8
    • 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, 2007, pp. 115-127.
    • (2007) Naval Research Logistics , vol.54 , pp. 115-127
    • Lim, A.1    Rodrigues, B.2    Xu, Z.3
  • 9
    • 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, pp. 345-360
    • (2009) Journal of Scheduling , vol.12 , pp. 345-360
    • Bierwirth, C.1    Meisel, F.2
  • 10
    • 84896315052 scopus 로고    scopus 로고
    • The crane scheduling problem: Models and solution approaches
    • in press, on-line in
    • Y. Guan, K.H. Yang, and, Z. Zhou, "The crane scheduling problem: models and solution approaches", Annals of Operation Research, in press, on-line in 2010.
    • (2010) Annals of Operation Research
    • Guan, Y.1    Yang, K.H.2    Zhou, Z.3


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