New bounds and algorithms for the transshipment yard scheduling problem
From MaRDI portal
Publication:2434300
DOI10.1007/s10951-010-0200-2zbMath1280.90033OpenAlexW2150752107MaRDI QIDQ2434300
Erwin Pesch, Florian Jaehn, Nils Boysen
Publication date: 5 February 2014
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-010-0200-2
Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Related Items
Gantry crane and shuttle car scheduling in modern rail-rail transshipment yards, Solving the single crane scheduling problem at rail transshipment yards, Positioning of loading units in a transshipment yard storage area, An integrated model for the transshipment yard scheduling problem, How to park freight trains on rail-rail transshipment yards: the train location problem, A truck scheduling problem arising in intermodal container transportation
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Optimised loading patterns for intermodal trains
- Scheduling trams in the morning
- TSP ejection chains
- Opportunities for OR in intermodal freight transport research: A review.
- The train marshalling problem
- Fuzzy dispatching model and genetic algorithms for railyards operations
- Real-time dispatch of trams in storage yards
- Modeling and optimization of the intermodal terminal mega hub
- 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
- A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
- Crane scheduling with non-crossing constraint
- One-Half Approximation Algorithms for the k-Partition Problem
- A m‐parallel crane scheduling problem with a non‐crossing constraint
