DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2007 · 40 citations · 10 references
ManagementIndustrial EngineeringOperations ManagementOperations PlanningOptimizationSchedulingCombinatorial OptimizationNetwork RobustnessOptimization Under UncertaintyReorder Point PlanningRobust OptimizationTransportation ProblemsAvailability OptimizationDisruptionsPrice Of RobustnessRobust SchedulingScenarios
In this paper we provide efficient robust algorithms for shunting problems concerning the reordering of train cars over a hump. In particular, we study algorithms able to cope with small disruptions, as temporary and local availability and/or malfunctioning of key resources that can occur and affect planned operations. To this aim, a definition of robust algorithm is provided. Performances of the proposed algorithms are measured by the notion of price of robustness. Various scenarios are considered, and interesting results are presented.
10
Dimitris Bertsimas, Melvyn Sim · Operations Research · 2004 · 4.4K citations
Elias Dahlhaus, Peter Horák, Mirka Miller et al. · Discrete Applied Mathematics · 2000 · 105 citations
Shunting of Passenger Train Units in a Railway Station
Richard Freling, Ramon Lentink, Leo Kroon et al. · Transportation Science · 2005 · 98 citations