메뉴 건너뛰기




Volumn 39, Issue 4, 2005, Pages 518-525

Maintenance routing for train units: The transition model

Author keywords

Maintenance routing; Rail transportation

Indexed keywords

COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING; TRAIN FERRIES;

EID: 28244465117     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1050.0116     Document Type: Article
Times cited : (82)

References (14)
  • 1
    • 35248900472 scopus 로고    scopus 로고
    • Train routing algorithms: Concepts, design choices, and practical considerations
    • Baltimore, MD
    • Anderegg, L., S. Eidenbenz, M. Gantenbein, Ch. Stamm, D. S. Taylor, B. Weber, P. Widmayer. 2003. Train routing algorithms: Concepts, design choices, and practical considerations. Proc. ALENEX'03, Baltimore, MD. www.siam.org/meetings/ alenex03/Abstracts/LAnderegg3.pdf.
    • (2003) Proc. ALENEX'03
    • Anderegg, L.1    Eidenbenz, S.2    Gantenbein, M.3    Stamm, Ch.4    Taylor, D.S.5    Weber, B.6    Widmayer, P.7
  • 3
    • 84986980023 scopus 로고
    • On some matching problems arising in vehicle scheduling models
    • Bertossi, A. A., P. Carraresi, G. Gallo. 1987. On some matching problems arising in vehicle scheduling models. Networks 17 271-281.
    • (1987) Networks , vol.17 , pp. 271-281
    • Bertossi, A.A.1    Carraresi, P.2    Gallo, G.3
  • 4
    • 0021429940 scopus 로고
    • Network models for vehicle and crew scheduling
    • Carraresi, P., G. Gallo. 1984. Network models for vehicle and crew scheduling. Eur. J. Oper. Res. 16 139-151.
    • (1984) Eur. J. Oper. Res. , vol.16 , pp. 139-151
    • Carraresi, P.1    Gallo, G.2
  • 6
    • 85059770931 scopus 로고
    • The complexity of theorem-proving procedures
    • The Association for Computing Machinery, New York
    • Cook, S. A. 1971. The complexity of theorem-proving procedures. Conf. Record 3rd Annual ACM Sympos. Theory Comput., The Association for Computing Machinery, New York, 151-158.
    • (1971) Conf. Record 3rd Annual ACM Sympos. Theory Comput. , pp. 151-158
    • Cook, S.A.1
  • 7
    • 77957089136 scopus 로고
    • Time constrained routing and scheduling
    • M. Ball, T. Magnanti, C. Monma, G. Nemhauser, eds. Elsevier, North-Holland, Amsterdam, The Netherlands
    • Desrosiers, J., Y. Dumas, M. M. Solomon, F. Soumis. 1995. Time constrained routing and scheduling. M. Ball, T. Magnanti, C. Monma, G. Nemhauser, eds. Handbooks in OR and MS, Vol. 8. Elsevier, North-Holland, Amsterdam, The Netherlands, 35-139.
    • (1995) Handbooks in or and MS , vol.8 , pp. 35-139
    • Desrosiers, J.1    Dumas, Y.2    Solomon, M.M.3    Soumis, F.4
  • 8
    • 0000627315 scopus 로고
    • Flight scheduling and maintenance base planning
    • Feo, T. A., J. F. Bard. 1989. Flight scheduling and maintenance base planning. Management Sci. 35(12) 1514-1532.
    • (1989) Management Sci. , vol.35 , Issue.12 , pp. 1514-1532
    • Feo, T.A.1    Bard, J.F.2
  • 9
    • 0032021506 scopus 로고    scopus 로고
    • The aircraft maintenance routing problem
    • Gopalan, R., K. T. Talluri. 1998. The aircraft maintenance routing problem. Oper. Res. 46(2) 260-271.
    • (1998) Oper. Res. , vol.46 , Issue.2 , pp. 260-271
    • Gopalan, R.1    Talluri, K.T.2
  • 11
    • 27144494648 scopus 로고    scopus 로고
    • Maintenance routing for train units: The Scenario Model
    • Maróti, G., L. G. Kroon. 2004. Maintenance routing for train units: The Scenario Model. CWI Res. Rep.
    • (2004) CWI Res. Rep.
    • Maróti, G.1    Kroon, L.G.2
  • 13
    • 0032000245 scopus 로고    scopus 로고
    • The four-day aircraft maintenance routing problem
    • Talluri, K. T. 1998. The four-day aircraft maintenance routing problem. Transportation Sci. 32(1) 43-53.
    • (1998) Transportation Sci. , vol.32 , Issue.1 , pp. 43-53
    • Talluri, K.T.1


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