Online integrated allocation of berths and quay cranes in container terminals with 1-lookahead

DOI10.1007/s10878-017-0113-5zbMath1400.90176OpenAlexW2585414546MaRDI QIDQ721944

Jiayin Pan, Gui-Qing Zhang, Yin-Feng Xu

Publication date: 20 July 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-017-0113-5

zbMATH Keywords

schedulingonline algorithmcontainer terminallookahead information

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Transport operations in container terminals: literature overview, trends, research directions and classification scheme
• Online interval scheduling on a single machine with finite lookahead
• Scheduling unit length jobs on parallel machines with lookahead information
• Improving the adaptability in automated vessel scheduling in container ports using intelligent software agents
• On-line scheduling with non-crossing constraints
• How much can lookahead help in online single machine scheduling
• A survey of berth allocation and quay crane scheduling problems in container terminals
• A scheduling method for Berth and Quay cranes
• An Online Model of Berth and Quay Crane Integrated Allocation in Container Terminals

This page was built for publication: Online integrated allocation of berths and quay cranes in container terminals with 1-lookahead