Interference aware scheduling of triple-crossover-cranes
From MaRDI portal
Publication:2197327
DOI10.1007/s10951-019-00634-6zbMath1446.90073WikidataQ126533807 ScholiaQ126533807MaRDI QIDQ2197327
Publication date: 31 August 2020
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-019-00634-6
scheduling; combinatorial optimization; branch and bound; container terminals; rail mounted gantry cranes
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B06: Transportation, logistics and supply chain management
90B35: Deterministic scheduling theory in operations research
90C27: Combinatorial optimization
Related Items
Optimizing the number of deployed yard cranes in a container terminal, Routing two stacking cranes with predetermined container sequences, Twin-crane scheduling during seaside workload peaks with a dedicated handshake area
Uses Software
Cites Work
- Transport operations in container terminals: literature overview, trends, research directions and classification scheme
- Scheduling co-operating stacking cranes with predetermined container sequences
- Scheduling automated triple cross-over stacking cranes in a container yard
- Discrete time model and algorithms for container yard crane scheduling
- Container terminal operation and operations research -- a classification and literature review
- A generalized classification scheme for crane scheduling with interference
- Storage yard operations in container terminals: literature overview, trends, and research directions
- An exact method for scheduling a yard crane
- Operations research at container terminals: a literature update
- Resolving interferences of triple‐crossover‐cranes by determining paths in networks
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
