Minimizing delays in a shunting yard

DOI10.1007/s00291-015-0391-1zbMath1311.90011OpenAlexW1984026584MaRDI QIDQ2018111

Andreas Wiehl, Johannes Rieder, Florian Jaehn

Publication date: 10 April 2015

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-015-0391-1

zbMATH Keywords

tabu searchbranch and boundshunting yardrailway systems

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• The train marshalling problem
• Track Allocation in Freight-Train Classification with Mixed Tracks
• Optimal Freight Train Classification using Column Generation
• Multistage methods for freight train classification
• Minimizing Total Tardiness on One Machine is NP-Hard
• New Precedence Theorems for One-Machine Weighted Tardiness
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness