메뉴 건너뛰기




Volumn 59, Issue , 2013, Pages 108-122

Constraint programming approach to quay crane scheduling problem

Author keywords

Constraint programming; Container terminals; Quay crane scheduling; Ready times; Time windows

Indexed keywords

ALGORITHM; CONTAINER TERMINAL; CRANE; MODELING; PERFORMANCE ASSESSMENT;

EID: 84885713891     PISSN: 13665545     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tre.2013.08.006     Document Type: Article
Times cited : (54)

References (34)
  • 1
    • 85170495866 scopus 로고    scopus 로고
    • Constraint propagation and backtracking-based search, 1st International Summer School on CP
    • September 2005
    • Bartak R. Constraint propagation and backtracking-based search, 1st International Summer School on CP. Acquafredda di Maraeta 2005, 11-15. September 2005.
    • (2005) Acquafredda di Maraeta , pp. 11-15
    • Bartak, R.1
  • 5
    • 68249120807 scopus 로고    scopus 로고
    • A fast heuristic for quay crane scheduling with interference constraints
    • Bierwirth C., Meisel F. A fast heuristic for quay crane scheduling with interference constraints. Journal of Scheduling 2009, 12:345-360.
    • (2009) Journal of Scheduling , vol.12 , pp. 345-360
    • Bierwirth, C.1    Meisel, F.2
  • 6
    • 70350568773 scopus 로고    scopus 로고
    • A survey of berth allocation and quay crane scheduling problems in container terminals
    • Bierwirth C., Meisel F. A survey of berth allocation and quay crane scheduling problems in container terminals. European Journal of Operational Research 2010, 202(3):615-627.
    • (2010) European Journal of Operational Research , vol.202 , Issue.3 , pp. 615-627
    • Bierwirth, C.1    Meisel, F.2
  • 7
    • 2942616688 scopus 로고    scopus 로고
    • Single-track multi-hoist scheduling problem: a collision-free resolution based on a branch-and-bound approach
    • Che A., Chu C. Single-track multi-hoist scheduling problem: a collision-free resolution based on a branch-and-bound approach. International Journal of Production Research 2004, 42(12):2435-2456.
    • (2004) International Journal of Production Research , vol.42 , Issue.12 , pp. 2435-2456
    • Che, A.1    Chu, C.2
  • 9
    • 0345075198 scopus 로고    scopus 로고
    • Local search and constraint programming
    • Kluwer Academic Publishers, Norwell, MA, F. Glover, G. Kochenberger (Eds.)
    • Focacci F., Laburthe F., Lodi A. Local search and constraint programming. Handbook of Metaheuristics 2002, Kluwer Academic Publishers, Norwell, MA. F. Glover, G. Kochenberger (Eds.).
    • (2002) Handbook of Metaheuristics
    • Focacci, F.1    Laburthe, F.2    Lodi, A.3
  • 10
    • 84890309169 scopus 로고    scopus 로고
    • Randomized large neighborhood search for cumulative scheduling. Conference on Automated Planning and Scheduling, Monterey, 5-10 June 2005, Monterey.
    • Godard, D., Laborie, P., Nuijten, W., 2005. Randomized large neighborhood search for cumulative scheduling. Conference on Automated Planning and Scheduling, Monterey, 5-10 June 2005, Monterey, pp. 81-89.
    • (2005) , pp. 81-89
    • Godard, D.1    Laborie, P.2    Nuijten, W.3
  • 12
    • 1642618965 scopus 로고    scopus 로고
    • A crane scheduling method for port container terminals
    • Kim K.H., Park Y.M. A crane scheduling method for port container terminals. European Journal of Operation Research 2004, 156:752-768.
    • (2004) European Journal of Operation Research , vol.156 , pp. 752-768
    • Kim, K.H.1    Park, Y.M.2
  • 13
    • 85170504663 scopus 로고    scopus 로고
    • Self-adapting large neighborhood search: application to single-mode scheduling problems. In: Proceedings of the 3rd Multidisciplinary International Conference on Scheduling: Theory and Applications, Paris, 28-31, August 2007.
    • Laborie, P., Godard, D., 2007. Self-adapting large neighborhood search: application to single-mode scheduling problems. In: Proceedings of the 3rd Multidisciplinary International Conference on Scheduling: Theory and Applications, Paris, 28-31, August 2007.
    • (2007)
    • Laborie, P.1    Godard, D.2
  • 14
    • 85170505699 scopus 로고    scopus 로고
    • Reasoning with conditional time-intervals. In: Proceedings of the 21st International FLAIRS Conference, Coconut Grove, 15-17 May 2008.
    • Laborie, P., Rogerie, J., 2008. Reasoning with conditional time-intervals. In: Proceedings of the 21st International FLAIRS Conference, Coconut Grove, 15-17 May 2008.
    • (2008)
    • Laborie, P.1    Rogerie, J.2
  • 15
    • 85170496921 scopus 로고    scopus 로고
    • Reasoning with conditional time-intervals - art II: an algebraical model for resources. In: Proceedings of the 22nd International FLAIRS Conference, Sanibel Island, 19-21 May 2009.
    • Laborie, P., Rogerie, J., Shaw, P., Vilim, P., 2009. Reasoning with conditional time-intervals - art II: an algebraical model for resources. In: Proceedings of the 22nd International FLAIRS Conference, Sanibel Island, 19-21 May 2009.
    • (2009)
    • Laborie, P.1    Rogerie, J.2    Shaw, P.3    Vilim, P.4
  • 16
    • 0028442512 scopus 로고
    • Implementation of resource constraints in ILOG scheduler
    • Le Pape C. Implementation of resource constraints in ILOG scheduler. Intelligent Systems Engineering 1994, 3(2):55-66.
    • (1994) Intelligent Systems Engineering , vol.3 , Issue.2 , pp. 55-66
    • Le Pape, C.1
  • 17
    • 77951130205 scopus 로고    scopus 로고
    • An improved approach for quay crane scheduling with non-crossing constraints
    • Lee D.-H., Chen J.H. An improved approach for quay crane scheduling with non-crossing constraints. Engineering Optimization 2010, 42(1):1-15.
    • (2010) Engineering Optimization , vol.42 , Issue.1 , pp. 1-15
    • Lee, D.-H.1    Chen, J.H.2
  • 18
    • 34948884022 scopus 로고    scopus 로고
    • Quay crane scheduling with non-interference constraints in port container terminals
    • Lee D.-H., Wang H.Q., Miao L. Quay crane scheduling with non-interference constraints in port container terminals. Transportation Research Part E 2008, 44(1):124-135.
    • (2008) Transportation Research Part E , vol.44 , Issue.1 , pp. 124-135
    • Lee, D.-H.1    Wang, H.Q.2    Miao, L.3
  • 20
    • 33847695719 scopus 로고    scopus 로고
    • A m-parallel crane scheduling problem with a non-crossing constraint
    • Lim A., Rodrigues B., Xu Z. A m-parallel crane scheduling problem with a non-crossing constraint. Naval Research Logistics 2007, 54(2):115-127.
    • (2007) Naval Research Logistics , vol.54 , Issue.2 , pp. 115-127
    • Lim, A.1    Rodrigues, B.2    Xu, Z.3
  • 21
    • 84880831475 scopus 로고    scopus 로고
    • A fast and simple algorithm for bounds consistency of the alldifferent constraint. In: Proceedings of the 18th International Joint Conference on Artificial Intelligence, Acapulco, 9-15 August 2003.
    • Lopez-Ortiz, A., Quimper, C.G., Tromp, J., van Beek, P., 2003. A fast and simple algorithm for bounds consistency of the alldifferent constraint. In: Proceedings of the 18th International Joint Conference on Artificial Intelligence, Acapulco, 9-15 August 2003, pp. 245-250.
    • (2003) , pp. 245-250
    • Lopez-Ortiz, A.1    Quimper, C.G.2    Tromp, J.3    van Beek, P.4
  • 22
    • 0035565940 scopus 로고    scopus 로고
    • Program does not equal program: constraint programming and its relationship to mathematical programming
    • Lustig I.J., Puget J.-F. Program does not equal program: constraint programming and its relationship to mathematical programming. Interfaces 2001, 31(6):29-53.
    • (2001) Interfaces , vol.31 , Issue.6 , pp. 29-53
    • Lustig, I.J.1    Puget, J.-F.2
  • 23
    • 80052282564 scopus 로고    scopus 로고
    • The quay crane scheduling with time windows
    • Meisel F. The quay crane scheduling with time windows. Naval Research Logistics 2011, 58(7):619-636.
    • (2011) Naval Research Logistics , vol.58 , Issue.7 , pp. 619-636
    • Meisel, F.1
  • 24
    • 77957307373 scopus 로고    scopus 로고
    • A unified approach for the evaluation of quay crane scheduling models and algorithms
    • Meisel F., Bierwirth C. A unified approach for the evaluation of quay crane scheduling models and algorithms. Computers & Operations Research 2011, 38:683-693.
    • (2011) Computers & Operations Research , vol.38 , pp. 683-693
    • Meisel, F.1    Bierwirth, C.2
  • 25
    • 84877934672 scopus 로고    scopus 로고
    • A framework for integrated berth allocation and crane operations planning in seaport container terminals
    • Meisel F., Bierwirth C. A framework for integrated berth allocation and crane operations planning in seaport container terminals. Transportation Science 2013, 47(2):131-147.
    • (2013) Transportation Science , vol.47 , Issue.2 , pp. 131-147
    • Meisel, F.1    Bierwirth, C.2
  • 26
    • 33645693040 scopus 로고    scopus 로고
    • A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
    • Moccia L., Cordeau J.F., Gaudioso M., Laporte G. A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal. Naval Research Logistics 2006, 53(1):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
  • 27
    • 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 1990, 24(3):159-172.
    • (1990) Transportation Research Part B , vol.24 , Issue.3 , pp. 159-172
    • Peterkofsky, R.I.1    Daganzo, C.F.2
  • 28
    • 0028567611 scopus 로고
    • A filtering algorithm for constraints of difference in CSP. In: Proceedings of 12th National Conference on Artificial Intelligence, Seattle, 1-4 August 1994.
    • Régin, J.-C., 1994. A filtering algorithm for constraints of difference in CSP. In: Proceedings of 12th National Conference on Artificial Intelligence, Seattle, 1-4 August 1994, pp. 362-367.
    • (1994) , pp. 362-367
    • Régin, J.-C.1
  • 29
  • 30
    • 84957372764 scopus 로고    scopus 로고
    • Using constraint programming and local search methods to solve vehicle routing problems
    • Shaw P. Using constraint programming and local search methods to solve vehicle routing problems. Lecture Notes in Computer Science 1998, 1520:417-431.
    • (1998) Lecture Notes in Computer Science , vol.1520 , pp. 417-431
    • Shaw, P.1
  • 31
    • 36248971841 scopus 로고    scopus 로고
    • Operations research at container terminals: a literature update
    • Stahlbock R., Voß S. Operations research at container terminals: a literature update. OR Spectrum 2008, 30(1):1-52.
    • (2008) OR Spectrum , vol.30 , Issue.1 , pp. 1-52
    • Stahlbock, R.1    Voß, S.2
  • 32
    • 17444364075 scopus 로고    scopus 로고
    • Container terminal operation and operations research - a classification and literature review
    • Steenken D., Voß S., Stahlbock R. Container terminal operation and operations research - a classification and literature review. OR Spectrum 2004, 26(1):3-49.
    • (2004) OR Spectrum , vol.26 , Issue.1 , pp. 3-49
    • Steenken, D.1    Voß, S.2    Stahlbock, R.3
  • 33
    • 59049093348 scopus 로고    scopus 로고
    • An efficient algorithm for solving a new mathematical model for a quay crane scheduling problem in container ports
    • Tavakkoli-Moghaddam R., Makui A., Salahi S., Bazzazi M., Taheri F. An efficient algorithm for solving a new mathematical model for a quay crane scheduling problem in container ports. Computers and Industrial Engineering 2009, 56(1):241-248.
    • (2009) Computers and Industrial Engineering , vol.56 , Issue.1 , pp. 241-248
    • Tavakkoli-Moghaddam, R.1    Makui, A.2    Salahi, S.3    Bazzazi, M.4    Taheri, F.5


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