Online integrated allocation of berths and quay cranes in container terminals with 1-lookahead
From MaRDI portal
Publication:721944
DOI10.1007/S10878-017-0113-5zbMATH Open1400.90176OpenAlexW2585414546MaRDI QIDQ721944FDOQ721944
Authors: Jiayin Pan, Yinfeng Xu, Gui-Qing Zhang 
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
Recommendations
- Online Integrated Allocation of Berths and Quay Cranes in Container Terminals with 1-Lookahead
- An online model of berth and quay crane integrated allocation in container terminals
- A study of online berth and quay crane integrated allocation problem with lookahead ability
- Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals
- Optimal berth allocation and time-invariant quay crane assignment in container terminals
Cites Work
- Title not available (Why is that?)
- A survey of berth allocation and quay crane scheduling problems in container terminals
- Transport operations in container terminals: literature overview, trends, research directions and classification scheme
- A scheduling method for Berth and Quay cranes
- On-line scheduling with non-crossing constraints
- Online interval scheduling on a single machine with finite lookahead
- Scheduling unit length jobs on parallel machines with lookahead information
- How much can lookahead help in online single machine scheduling
- An online model of berth and quay crane integrated allocation in container terminals
- Improving the adaptability in automated vessel scheduling in container ports using intelligent software agents
Cited In (3)
This page was built for publication: Online integrated allocation of berths and quay cranes in container terminals with 1-lookahead
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q721944)
