A study of online berth and quay crane integrated allocation problem with lookahead ability

DOI10.15960/J.CNKI.ISSN.1007-6093.2018.03.003MaRDI QIDQ5197271zbMATH OpenFDO

Authors Ying Li, Longliang Qiao, Feifeng Zheng

Publication date 20 September 2019

zbMATH Keywords

competitive ratioonline algorithmlookaheadcontainer portscheduling decision making

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Online Integrated Allocation of Berths and Quay Cranes in Container Terminals with 1-Lookahead
• 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
• Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals
• A survey of berth allocation and quay crane scheduling problems in container terminals

Cited in

(5)

• Semi-online scheduling on two identical parallel machines with initial-lookahead information
• Online integrated allocation of berths and quay cranes in container terminals with 1-lookahead
• Semi-online scheduling on two uniform parallel machines with initial lookahead
• An online model of berth and quay crane integrated allocation in container terminals
• Online Integrated Allocation of Berths and Quay Cranes in Container Terminals with 1-Lookahead

This page was built for publication: A study of online berth and quay crane integrated allocation problem with lookahead ability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5197271)