Compact ILP formulations for a class of solutions to berth allocation and quay crane scheduling problems

DOI10.1007/s12597-021-00552-2OpenAlexW3191545389MaRDI QIDQ2150520

G. S. R. Murthy, T. R. Lalita

Publication date: 27 June 2022

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-021-00552-2

zbMATH Keywords

transportationschedulingmathematical programmingberth allocationquay crane schedulingOR in container terminals

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
• Tactical berth allocation under uncertainty
• Optimal policies for the berth allocation problem under stochastic nature
• The service allocation problem at the Gioia Tauro maritime terminal
• Berth allocation at indented berths for mega-containerships
• A survey of berth allocation and quay crane scheduling problems in container terminals
• The berth planning problem
• The berth allocation problem: models and solution methods
• An adaptive large neighborhood search for the discrete and continuous berth allocation problem
• MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem
• A crane scheduling method for port container terminals
• Optimal berth allocation and time-invariant quay crane assignment in container terminals
• A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results
• The crane scheduling problem: models and solution approaches
• Crane scheduling with spatial constraints
• A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
• Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
• Optimizing ship berthing
• Berth allocation planning in the public berth system by genetic algorithms

This page was built for publication: Compact ILP formulations for a class of solutions to berth allocation and quay crane scheduling problems