The quay crane scheduling problem with non-crossing and safety clearance constraints: an exact solution approach
From MaRDI portal
Publication:1738835
DOI10.1016/J.COR.2019.03.014zbMath1458.90244OpenAlexW2923560181WikidataQ128136102 ScholiaQ128136102MaRDI QIDQ1738835
Publication date: 18 April 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2019.03.014
Related Items (6)
Optimization for integrated scheduling of intelligent handling equipment with bidirectional flows and limited buffers at automated container terminals ⋮ Pilotage planning in seaports ⋮ Scheduling quay cranes and shuttle vehicles simultaneously with limited apron buffer capacity ⋮ Simultaneous operation of next-generation and traditional quay cranes at container terminals ⋮ The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions ⋮ Berth and quay crane allocation and scheduling problem with renewable energy uncertainty: a robust exact decomposition
Cites Work
- A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
- Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals
- A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints
- A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules
- A generalized classification scheme for crane scheduling with interference
- Approximate the scheduling of quay cranes with non-crossing constraints
- A crane scheduling method for port container terminals
- An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem
- The crane scheduling problem: models and solution approaches
- Modeling and solution of the joint quay crane and truck scheduling problem
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Crane scheduling with spatial constraints
- Crane scheduling with non-crossing constraint
- Algorithm Theory - SWAT 2004
This page was built for publication: The quay crane scheduling problem with non-crossing and safety clearance constraints: an exact solution approach