IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v49y1999i1p137-148.html
   My bibliography  Save this article

Scheduling trams in the morning

Author

Listed:
  • Ulrich Blasum
  • Michael R. Bussieck
  • Winfried Hochstättler
  • Christoph Moll
  • Hans-Helmut Scheel
  • Thomas Winter

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. Copyright Springer-Verlag Berlin Heidelberg 1999

Suggested Citation

  • Ulrich Blasum & Michael R. Bussieck & Winfried Hochstättler & Christoph Moll & Hans-Helmut Scheel & Thomas Winter, 1999. "Scheduling trams in the morning," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 49(1), pages 137-148, March.
    • Handle: RePEc:spr:mathme:v:49:y:1999:i:1:p:137-148
    DOI: 10.1007/PL00020912
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/PL00020912
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/PL00020912?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Lehnfeld, Jana & Knust, Sigrid, 2014. "Loading, unloading and premarshalling of stacks in storage areas: Survey and classification," European Journal of Operational Research, Elsevier, vol. 239(2), pages 297-312.
    2. David Boywitz & Nils Boysen & Dirk Briskorn, 2016. "Resequencing with parallel queues to minimize the maximum number of items in the overflow area," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(5), pages 401-415, August.
    3. Sven Boge & Sigrid Knust, 2023. "The blocks relocation problem with item families minimizing the number of reshuffles," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 45(2), pages 395-435, June.
    4. Haahr, Jørgen & Lusby, Richard M., 2017. "Integrating rolling stock scheduling with train unit shunting," European Journal of Operational Research, Elsevier, vol. 259(2), pages 452-468.
    5. Boysen, Nils & Emde, Simon, 2016. "The parallel stack loading problem to minimize blockages," European Journal of Operational Research, Elsevier, vol. 249(2), pages 618-627.
    6. Mohamed Hamdouni & Guy Desaulniers & Odile Marcotte & François Soumis & Marianne van Putten, 2006. "Dispatching Buses in a Depot Using Block Patterns," Transportation Science, INFORMS, vol. 40(3), pages 364-377, August.
    7. Nils Boysen & Florian Jaehn & Erwin Pesch, 2011. "Scheduling Freight Trains in Rail-Rail Transshipment Yards," Transportation Science, INFORMS, vol. 45(2), pages 199-211, May.
    8. Florian Jaehn & Alena Otto & Kilian Seifried, 2018. "Shunting operations at flat yards: retrieving freight railcars from storage tracks," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(2), pages 367-393, March.
    9. Bortfeldt, Andreas & Forster, Florian, 2012. "A tree search procedure for the container pre-marshalling problem," European Journal of Operational Research, Elsevier, vol. 217(3), pages 531-540.
    10. Boysen, Nils & Fliedner, Malte & Jaehn, Florian & Pesch, Erwin, 2012. "Shunting yard operations: Theoretical aspects and applications," European Journal of Operational Research, Elsevier, vol. 220(1), pages 1-14.
    11. Hamdouni, Mohamed & Soumis, Francois & Desaulniers, Guy, 2007. "Parking buses in a depot with stochastic arrival times," European Journal of Operational Research, Elsevier, vol. 183(2), pages 502-515, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:mathme:v:49:y:1999:i:1:p:137-148. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.