Skip to main content
Log in

A railway scheduling problem

  • Published:
Zeitschrift für Operations Research Aims and scope Submit manuscript

Abstract

It is discussed hown railway routes arriving regularly at some station should be scheduled to minimize the maximum waiting time for passengers changing trains.

Zusammenfassung

In der Arbeit wird untersucht, wie man fürn Eisenbahnlinien, die in regelmä\igen Abständen in einem Bahnhof eintreffen, die optimale Reihenfolge erhält, so da\ die maximale Wartezeit für die Reisenden, die in den Zug einer anderen Linie umsteigen wollen, minimiert wird.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Burkard RE (1985) Optimal schedules for periodically recurring events. Bericht 85-59, Institut für Mathematik, Technische Universität Graz, to appear in Discrete Applied Mathematics

  • Dudley U (1978) Elementary number theory. Freeman San Francisco

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Brucker, P., Hurink, J. A railway scheduling problem. Zeitschrift für Operations Research 30, A223–A227 (1986). https://doi.org/10.1007/BF01919290

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01919290

Key words

Navigation