Skip to main content
Log in

Scheduling trams in the morning

  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

Abstract.

In this note, we prove ??-completeness of the following problem: Given a set of trams of different types, which are stacked on sidings in their depot and an order in which trams of specified types are supposed to leave. Is there an assignment of trams to departure times without any shunting movements? In the particular case where the number of sidings is fixed, the problem is solvable in polynomial time. We derive a dynamic program and improve its performance by a state elimination scheme. We implemented three variants of the dynamic program and applied them to random data as well as to real-world data.

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.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Manuscript received: March 1997/final version received: June 1998

Rights and permissions

Reprints and permissions

About this article

Cite this article

Blasum, U., Bussieck, M., Hochstättler, W. et al. Scheduling trams in the morning. Mathematical Methods of OR 49, 137–148 (1999). https://doi.org/10.1007/PL00020912

Download citation

  • Issue Date:

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

Navigation