A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints

DOI10.1007/S10479-016-2239-8zbMATH Open1357.90046OpenAlexW2409315814MaRDI QIDQ513546FDOQ513546

Authors: Noura Al-Dhaheri, Ali 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

Recommendations

• A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results
• A Lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem
• The crane scheduling problem: models and solution approaches
• A heuristic for the quay crane scheduling problem based on contiguous bay crane operations
• The quay crane scheduling problem with non-crossing and safety clearance constraints: an exact solution approach

zbMATH Keywords

container terminalsLagrangian relaxationquay crane schedulingmaritime logisticsship stability

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Boolean programming (90C09)

Cites Work

• A crane scheduling method for port container terminals
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results
• Container sequencing for quay cranes with internal reshuffles
• Modeling and solving rich quay crane scheduling problems
• 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
• On the berth allocation problem
• The quay crane scheduling problem with time windows
• Determining crane areas for balancing workload among interfering and noninterfering cranes
• 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 local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules
• On-line scheduling with non-crossing constraints
• Simulation-based optimization for discharge/loading operations at a maritime container terminal
• A note on differential and integral equations in the spaces of functions of \(\Lambda \)-bounded variation
• A Lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem
• The dynamic berth allocation problem: A linearized formulation
• Scheduling small number of quay cranes with non-interference constraint

Cited In (15)

• On the berth allocation problem
• An integrated berth allocation and yard assignment problem for bulk ports: Formulation and case study
• The dynamic berth allocation problem: A linearized formulation
• The quay crane scheduling problem with non-crossing and safety clearance constraints: an exact solution approach
• A Lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem
• Throughput optimization for the robotic cell problem with controllable processing times
• 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
• A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results
• An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability
• Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint
• Effects of feasibility cuts in Lagrangian relaxation for a two-stage stochastic facility location and network flow problem
• Dynamically scheduling ships to multiple continuous berth spaces in an iron and steel complex
• 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

Uses Software

• CPLEX

This page was built for publication: A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints

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