A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results

DOI10.1007/s11590-014-0787-xzbMath1320.90044OpenAlexW2106627552MaRDI QIDQ2341106

Effrosyni Theodorou, Ali H. Diabat

Publication date: 23 April 2015

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-014-0787-x

zbMATH Keywords

Lagrangian relaxationcontainer terminalsconstraint generationquay crane assignmentquay crane schedulingrestoration technique

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)

Related Items (8)

Multiple-vendor, multiple-retailer based vendor-managed inventory ⋮ Compact ILP formulations for a class of solutions to berth allocation and quay crane scheduling problems ⋮ MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem ⋮ An integrated berth allocation and yard assignment problem for bulk ports: Formulation and case study ⋮ An integrated supply chain problem: a nested Lagrangian relaxation approach ⋮ A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints ⋮ On the Berth Allocation Problem ⋮ The Dynamic Berth Allocation Problem: A linearized formulation

Cites Work

• A survey of berth allocation and quay crane scheduling problems in container terminals
• A crane scheduling method for port container terminals
• A fast heuristic for quay crane scheduling with interference constraints
• A Lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem
• The crane scheduling problem: models and solution approaches
• The quay crane scheduling problem with time windows
• Inducing coordination in supply chains through linear reward schemes
• Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
• Approximate Expressions for Queueing Systems with Scheduled Arrivals and Established Service Order
• The Dynamic Berth Allocation Problem: A linearized formulation

This page was built for publication: A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results