Crane scheduling in railway yards: an analysis of computational complexity

DOI10.1007/s10951-017-0520-6zbMath1391.90321OpenAlexW2607640369MaRDI QIDQ1707828

Nils Boysen, Konrad Stephan

Publication date: 4 April 2018

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-017-0520-6

zbMATH Keywords

computational complexitycrane schedulingintermodal transportationrailway yards

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

Minimizing the makespan on a single machine subject to modular setups ⋮ Solving the single crane scheduling problem at rail transshipment yards ⋮ Levelling crane workload in multi-yard rail-road container terminals

Uses Software

• DARCLASS

Cites Work

• Unnamed Item
• A survey on single crane scheduling in automated storage/retrieval systems
• How to park freight trains on rail-rail transshipment yards: the train location problem
• Modeling and optimization of the intermodal terminal mega hub
• When road trains supply freight trains: scheduling the container loading process by gantry crane between multi-trailer trucks and freight trains
• The dial-a-ride problem: Models and algorithms
• Optimizing the landside operation of a container terminal
• A review of TSP based approaches for flowshop scheduling
• Determining crane areas in intermodal transshipment yards: the yard partition problem
• Algorithmic Aspects of Pyramidal Tours with Restricted Jump-Backs
• Computer-Aided Complexity Classification of Dial-a-Ride Problems
• Integer Programming Formulation of Traveling Salesman Problems
• Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
• Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
• The n-line traveling salesman problem
• Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
• Clustering-based order-picking sequence algorithm for an automated warehouse
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• Solution of a Large-Scale Traveling-Salesman Problem
• The complexity of satisfiability problems
• Routing order pickers in a warehouse with a middle aisle

This page was built for publication: Crane scheduling in railway yards: an analysis of computational complexity