In this paper, the single-track railway scheduling problem with two stations and several segments of the track is considered. Two subsets of trains are given, where trains from the first subset go from the first station to the second station, and trains from the second subset go in the opposite direction. The speed of trains over each segment is the same. A polynomial time reduction from the problem under consideration to a special case of the single-machine equal-processing-time scheduling problem with setup times is presented. Different polynomial time algorithms are developed for special cases with divers objective functions under various constraints. Moreover, several theoretical results which can be ranked in a series of similar investigations of NP-hardness of equal-processing-time single-machine scheduling problems without precedence relations are obtained.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Two-station single-track railway scheduling problem with trains of equal speed


    Beteiligte:

    Erschienen in:

    Erscheinungsdatum :

    2015


    Format / Umfang :

    8 Seiten, 25 Quellen




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Print


    Sprache :

    Englisch




    On modelling the railway track for high-speed trains

    Bogacz, R. / Krzyzynski, T. / Popp, K. et al. | British Library Conference Proceedings | 1994


    Dynamic Scheduling Model and Algorithm for Dispatching Trains in High-Speed Railway Passenger Station

    Yue, Y. / Zhou, L. / American Society of Mechanical Engineers | British Library Conference Proceedings | 2010



    New trains + new track = modern new railway

    Statistik (ZCO22) | IuD Bahn | 1999


    Optimal scheduling of trains on a single line track

    Higgins, A. | Online Contents | 1996