Crane scheduling in railway yards: an analysis of computational complexity
type: Item
instance of: scholarly article
title: Crane scheduling in railway yards: an analysis of computational complexity
zbMATH Open document ID: 1391.90321
author: Konrad Stephan
author: Nils Boysen
published in: Journal of Scheduling
publication date: 2018-04-04T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 6855596
zbMATH Keywords: intermodal transportation
zbMATH Keywords: railway yards
zbMATH Keywords: crane scheduling
zbMATH Keywords: computational complexity
describes a project that uses: DARCLASS
MaRDI profile type: Publication
full work available at URL: s10951-017-0520-6
OpenAlex ID: W2607640369
cites work: Modeling and optimization of the intermodal terminal mega hub
cites work: Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
cites work: A review of TSP based approaches for flowshop scheduling
cites work: Determining crane areas in intermodal transshipment yards: the yard partition problem
cites work: When road trains supply freight trains: scheduling the container loading process by gantry crane between multi-trailer trucks and freight trains
cites work: A survey on single crane scheduling in automated storage/retrieval systems
cites work: Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
cites work: The dial-a-ride problem: Models and algorithms
cites work: Solution of a Large-Scale Traveling-Salesman Problem
cites work: Computer-aided complexity classification of dial-a-ride problems
cites work: Optimizing the landside operation of a container terminal
cites work: Q4198056
cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
cites work: How to park freight trains on rail-rail transshipment yards: the train location problem
cites work: Clustering-based order-picking sequence algorithm for an automated warehouse
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: Algorithmic aspects of pyramidal tours with restricted jump-backs
cites work: Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
cites work: Routing order pickers in a warehouse with a middle aisle
cites work: The n-line traveling salesman problem
cites work: The complexity of satisfiability problems
DOI: 10.1007/S10951-017-0520-6
description: scientific article; zbMATH DE number 6855596