Minimizing delays in a shunting yard

DOI10.1007/S00291-015-0391-1zbMATH Open1311.90011OpenAlexW1984026584MaRDI QIDQ2018111FDOQ2018111

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

Recommendations

• Adapting exact and heuristic procedures in solving an NP-hard sequencing problem
• An integrated dispatching model for rail yards operations.
• The basic train makeup problem in shunting yards
• Minimizing the maximal weighted lateness of delivering orders between two railroad stations
• Shunting operations at flat yards: retrieving freight railcars from storage tracks

zbMATH Keywords

branch and boundtabu searchrailway systemsshunting yard

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Minimizing Total Tardiness on One Machine is NP-Hard
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• New Precedence Theorems for One-Machine Weighted Tardiness
• The train marshalling problem
• Multistage methods for freight train classification
• Track allocation in freight-train classification with mixed tracks
• Optimal freight train classification using column generation

Cited In (3)

• An integrated dispatching model for rail yards operations.
• Reconfiguring shortest paths in graphs
• Reducing Delivery Delay in HRM Tree

Uses Software

• CPLEX

This page was built for publication: Minimizing delays in a shunting yard

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018111)