A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints
From MaRDI portal
Publication:513546
DOI10.1007/s10479-016-2239-8zbMath1357.90046OpenAlexW2409315814MaRDI QIDQ513546
Noura Al-Dhaheri, Ali H. Diabat
Publication date: 7 March 2017
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-016-2239-8
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)
Related Items
Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint, Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level, 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, Throughput optimization for the Robotic Cell Problem with Controllable Processing Times, An integrated berth allocation and yard assignment problem for bulk ports: Formulation and case study, The quay crane scheduling problem with non-crossing and safety clearance constraints: an exact solution approach, An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability, Effects of feasibility cuts in Lagrangian relaxation for a two-stage stochastic facility location and network flow problem, On the Berth Allocation Problem, The Dynamic Berth Allocation Problem: A linearized formulation
Uses Software
Cites Work
- A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
- Hybrid evolutionary computation methods for quay crane scheduling problems
- On double cycling for container port productivity improvement
- A heuristic for the quay crane scheduling problem based on contiguous bay crane operations
- A note on differential and integral equations in the spaces of functions of \(\Lambda \)-bounded variation
- A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules
- On-line scheduling with non-crossing constraints
- Container sequencing for quay cranes with internal reshuffles
- Simulation-based optimization for discharge/loading operations at a maritime container terminal
- Modeling and solving rich quay crane scheduling problems
- A crane scheduling method for port container terminals
- Scheduling small number of quay cranes with non-interference constraint
- An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem
- A Lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem
- A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results
- The crane scheduling problem: models and solution approaches
- Modeling and solution of the joint quay crane and truck scheduling problem
- On the Berth Allocation Problem
- The quay crane scheduling problem with time windows
- Determining crane areas for balancing workload among interfering and noninterfering cranes
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The Dynamic Berth Allocation Problem: A linearized formulation
