Optimal sorting of rolling stock at hump yards

Mathematics - Key Technology for the Future: Joint Projects Between Universities and Industry 2004-2007

Volumn , Issue , 2008, Pages 189-203

  Hansmann, Ronny S ^a   Zimmermann, Uwe T ^a  

^a TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84892061205     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-3-540-77203-3_14     Document Type: Chapter

References (15)

1. H.L. Bodlaender and K. Jansen. Restrictions of graph partition problems. Part I. Theoretical Computer Science, 148(1):93-109, 1995.
2. E. Dahlhaus, P. Horak, M. Miller, and J.F. Ryan. The train marshalling problem. Discrete Applied Mathematics, 103(1-3):41-54, 2000.
3. E. Dahlhaus, F. Manne, M. Miller, and J.F. Ryan. Algorithms for combinatorial problems related to train marshalling. In Proceedings of AWOCA 2000, pages 7-16, Hunter Valley, 2000.
4. G. Di Stefano and M.L. Koči. A graph theoretical approach to the shunting problem. Electronic Notes in Theoretical Computer Science, 92:16-33, 2004.
5. G. Di Stefano, ST Krause, M.E. Lübbecke, and U.T. Zimmermann. On minimum k-modal partitions of permutations. In J.R. Correa, A. Hevia, and M. Kiwi, editors, Latin American Theoretical Informatics (LATIN2006), volume 3887 of Lecture Notes in Computer Science, pages 374-385. Springer-Verlag, Berlin, 2006.
6. G. Di Stefano and U.T. Zimmermann. Short note on complexity and approximability of unimodal partitions of permutations. Technical report, Inst. Math. Opt., Braunschweig University of Technology, 2005.
7. F.V. Fomin, D. Kratsch, and J.-Ch. Novelle. Approximating minimum cocolourings. Information Processing Letters, 84(5):285-290, 2002.
8. R.S. Hansmann. Optimal sorting of rolling stock (in preparation). PhD thesis, Inst. Math. Opt., Braunschweig Technical University Carolo-Wilhelmina.
9. R.S. Hansmann and U.T. Zimmermann. The sorting of rolling stock problem (in preparation).
10. D.S. Hirschberg and M. Régnier. Tight bounds on the number of string subsequences. Journal of Discrete Algorithms, 1(1):123-132, 2000.
11. R. Jacob. On shunting over a hump. unpublished. 2007.
12. K. Jansen. The mutual exclusion scheduling problem for permutation and comparability graphs. Information and Computation, 180(2):71-81, 2003.
13. K. Wagner. Monotonic coverings of finite sets. Elektronische Informationsverarbeitung und Kybernetik, 20(12):633-639, 1984.
14. T. Winter. Online and real-time dispatching problems. PhD thesis, Inst. Math. Opt., Technical University Carolo-Wilhelmina, 2000.
15. T. Winter and U.T. Zimmermann. Real-time dispatch of trams in storage yards. Annals of Operations Research, 96:287-315, 2000.