A note on scheduling container storage operations of two non‐passing stacking cranes

DOI10.1002/net.21803zbMath1386.90059OpenAlexW2775878776MaRDI QIDQ4638575

Andrew Ryzhikov, Erwin Pesch, Mikhail Y. Kovalyov

Publication date: 27 April 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21803

zbMATH Keywords

algorithmscomputational complexityschedulingapproximationlogisticsstacking cranes

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Twin-crane scheduling during seaside workload peaks with a dedicated handshake area ⋮ Solving the single crane scheduling problem at rail transshipment yards ⋮ Scheduling cooperative gantry cranes with seaside and landside jobs ⋮ An exact solution approach for scheduling cooperative gantry cranes ⋮ A decomposition-based approach to the scheduling of identical automated yard cranes at container terminals ⋮ Routing two stacking cranes with predetermined container sequences ⋮ Straddle carrier routing at seaport container terminals in the presence of short term quay crane buffer areas

This page was built for publication: A note on scheduling container storage operations of two non‐passing stacking cranes