An integrated model for the transshipment yard scheduling problem
From MaRDI portal
Publication:1707671
DOI10.1007/s10951-016-0470-4zbMath1391.90249OpenAlexW2301434968WikidataQ57387683 ScholiaQ57387683MaRDI QIDQ1707671
Gaurav Singh, Grzegorz Pawlak, Florian Jaehn, Mateusz Cichenski, Erwin Pesch, Jacek Błażewicz
Publication date: 3 April 2018
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-016-0470-4
Mixed integer programming (90C11) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Solving the single crane scheduling problem at rail transshipment yards ⋮ Levelling crane workload in multi-yard rail-road container terminals
Cites Work
- Unnamed Item
- How to park freight trains on rail-rail transshipment yards: the train location problem
- A tabu search heuristic for the quay crane scheduling problem
- Scheduling automated triple cross-over stacking cranes in a container yard
- Optimised loading patterns for intermodal trains
- Opportunities for OR in intermodal freight transport research: A review.
- The train marshalling problem
- Modeling and optimization of the intermodal terminal mega hub
- New bounds and algorithms for the transshipment yard scheduling problem
- Determining crane areas in intermodal transshipment yards: the yard partition problem
- Models and Algorithms for Container Allocation Problems on Trains in a Rapid Transshipment Shunting Yard
- A Survey of Optimization Models for Train Routing and Scheduling
- Multistage methods for freight train classification
- A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
- Crane scheduling with non-crossing constraint
- Shunting for Dummies: An Introductory Algorithmic Survey
- A m‐parallel crane scheduling problem with a non‐crossing constraint
