Routing two stacking cranes with predetermined container sequences

DOI10.1007/s10951-021-00689-4zbMath1479.90080OpenAlexW3175488496MaRDI QIDQ2059087

Dirk Briskorn

Publication date: 13 December 2021

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

Full work available at URL: https://doi.org/10.1007/s10951-021-00689-4

zbMATH Keywords

container logisticsport operationsgantry crane schedulingresolving mutual interference

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items (1)

Twin-crane scheduling during seaside workload peaks with a dedicated handshake area

Cites Work

• Transport operations in container terminals: literature overview, trends, research directions and classification scheme
• A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
• Cooperative twin-crane scheduling
• 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
• A survey of berth allocation and quay crane scheduling problems in container terminals
• Container terminal operation and operations research -- a classification and literature review
• A generalized classification scheme for crane scheduling with interference
• Scheduling cooperative gantry cranes with seaside and landside jobs
• Transshipment of containers at a container terminal: An overview
• An exact solution approach for scheduling cooperative gantry cranes
• Interference aware scheduling of triple-crossover-cranes
• Storage yard operations in container terminals: literature overview, trends, and research directions
• An exact method for scheduling a yard crane
• A decomposition-based approach to the scheduling of identical automated yard cranes at container terminals
• Operations research at container terminals: a literature update
• Resolving interferences of triple‐crossover‐cranes by determining paths in networks
• A decomposition heuristic for the twin robots scheduling problem
• A note on scheduling container storage operations of two non‐passing stacking cranes

This page was built for publication: Routing two stacking cranes with predetermined container sequences