Büsing, ChristinaMaue, Jens2021-12-172021-12-1720102197-8085https://depositonce.tu-berlin.de/handle/11303/15690http://dx.doi.org/10.14279/depositonce-14463We consider a sorting problem from railway optimization called train classification: incoming trains are split up into their single cars and reassembled to form new outgoing trains. Trains are subject to delay, which may turn a prepared sorting schedule infeasible for the disturbed situation. The classification methods applied today deal with this issue by completely disregarding the input order of cars, which provides robustness against any amount of disturbance but also wastes the potential contained in the a priori knowledge about the input.en510 Mathematikrobust optimizationrailway optimizationsorting of phyiscal objectscomputational complexityResearch Paper