ZIB

Treffer pro Seite

Treffer 1 - 1 | 1 Treffer

Sortierung

Digitale Medien

Scheduling trams in the morning (1999)

Blasum, Ulrich ; Bussieck, Michael R. ; Hochstättler, Winfried ; [weitere]

Springer

Mathematical methods of operations research 49 (1999), S. 137-148

zur Merkliste hinzufügen auf der Merkliste

Details

ISSN: 1432-5217

Schlagwort(e): Key words: Combinatorial optimization ; complexity ; ℳ?-completeness ; scheduling ; assignment ; stack

Quelle: Springer Online Journal Archives 1860-2000

Thema: Mathematik , Wirtschaftswissenschaften

Notizen: 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.

Materialart: Digitale Medien

URL: http://dx.doi.org/10.1007/s001860050018

Permalink

Bibliothek	Standort	Signatur	Band/Heft/Jahr	Verfügbarkeit

Andere fanden auch interessant ...

Artikel (Nationallizenzen)

Volltext

Treffer 1 - 1 | 1 Treffer