Blasum, Ulrich; Bussieck, Michael R.; Hochstättler, … - In: Mathematical Methods of Operations Research 49 (1999) 1, pp. 137-148
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...
