메뉴 건너뛰기




Volumn 35, Issue 5, 2005, Pages 393-401

Reinventing crew scheduling at netherlands railways

Author keywords

Government: services; Transportation: scheduling

Indexed keywords


EID: 27844585528     PISSN: 00922102     EISSN: None     Source Type: Journal    
DOI: 10.1287/inte.1050.0158     Document Type: Review
Times cited : (71)

References (10)
  • 2
    • 0033351565 scopus 로고    scopus 로고
    • A heuristic method for the set-covering problem
    • Caprara, A., M. Fischetti, P. Toth. 1999b. A heuristic method for the set-covering problem. Oper. Res. 47(5) 730-743.
    • (1999) Oper. Res. , vol.47 , Issue.5 , pp. 730-743
    • Caprara, A.1    Fischetti, M.2    Toth, P.3
  • 3
    • 0002441654 scopus 로고    scopus 로고
    • Solution of large scale railway crew planning problems: The Italian experience
    • N. H. M. Wilson, ed. Springer-Verlag, Berlin, Germany
    • Caprara, A., M. Fischetti, P. L. Guida, P. Toth, D. Vigo. 1999a. Solution of large scale railway crew planning problems: The Italian experience. N. H. M. Wilson, ed. Computer Aided Transit Scheduling. Springer-Verlag, Berlin, Germany, 1-18.
    • (1999) Computer Aided Transit Scheduling , pp. 1-18
    • Caprara, A.1    Fischetti, M.2    Guida, P.L.3    Toth, P.4    Vigo, D.5
  • 5
    • 77957089136 scopus 로고
    • Time constrained routing and scheduling
    • M. O. Ball, T. L. Magnanti, C. L. Monma, G. L. Nemhauser, eds. Elsevier Science Publishers, Amsterdam, The Netherlands
    • Desrosiers, J., Y. Dumas, M. M. Solomon, F. Soumis. 1995. Time constrained routing and scheduling. M. O. Ball, T. L. Magnanti, C. L. Monma, G. L. Nemhauser, eds. Network Routing,Handbooks in OR and MS, Vol. 8. Elsevier Science Publishers, Amsterdam, The Netherlands, 35-139.
    • (1995) Network Routing,Handbooks in or and MS , vol.8 , pp. 35-139
    • Desrosiers, J.1    Dumas, Y.2    Solomon, M.M.3    Soumis, F.4
  • 6
    • 0027614308 scopus 로고
    • Solving airline crew scheduling problems by branch-and-cut
    • Hoffmann, K. L., M. W. Padberg. 1993. Solving airline crew scheduling problems by branch-and-cut. Management Sci. 39(6) 657-682.
    • (1993) Management Sci. , vol.39 , Issue.6 , pp. 657-682
    • Hoffmann, K.L.1    Padberg, M.W.2
  • 7
    • 27144466083 scopus 로고    scopus 로고
    • Solving the world's largest crew scheduling problem
    • Kohl, N. 2003. Solving the world's largest crew scheduling problem. ORbit Extra,Newsletter Danish Oper. Res. Soc. 4(Special Issue, August) 8-12.
    • (2003) ORbit Extra, Newsletter Danish Oper. Res. Soc. , vol.4 , Issue.SPEC. ISSUE AND AUGUST , pp. 8-12
    • Kohl, N.1
  • 8
    • 0010651529 scopus 로고    scopus 로고
    • Crew scheduling for Netherlands Railways: "Destination: customer."
    • J. Daduna, S. Voss, eds. Springer-Verlag, Berlin, Germany
    • Kroon, L. G., M. Fischetti. 2001. Crew scheduling for Netherlands Railways: "Destination: customer." J. Daduna, S. Voss, eds. Computer Aided Scheduling of Public Transport. Springer-Verlag, Berlin, Germany, 181-201.
    • (2001) Computer Aided Scheduling of Public Transport , pp. 181-201
    • Kroon, L.G.1    Fischetti, M.2
  • 9
    • 3543131150 scopus 로고    scopus 로고
    • Producing train driver crew schedules under different operating strategies
    • N. H. M. Wilson, ed. Springer-Verlag, Berlin, Germany
    • Kwan, A. S. K., R. S. K. Kwan, M. E. Parker, A. Wren. 1999. Producing train driver crew schedules under different operating strategies. N. H. M. Wilson, ed. Computer Aided Transit Scheduling. Springer-Verlag, Berlin, Germany, 129-154.
    • (1999) Computer Aided Transit Scheduling , pp. 129-154
    • Kwan, A.S.K.1    Kwan, R.S.K.2    Parker, M.E.3    Wren, A.4
  • 10
    • 21844527216 scopus 로고
    • An algorithm for large scale 0-1 integer programming with application to airline crew scheduling
    • Wedelin, D. 1995. An algorithm for large scale 0-1 integer programming with application to airline crew scheduling. Ann. Oper. Res. 57 283-301.
    • (1995) Ann. Oper. Res. , vol.57 , pp. 283-301
    • Wedelin, D.1


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