A Lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem

DOI10.1016/J.APM.2014.07.006zbMATH Open1432.90055OpenAlexW2064327494MaRDI QIDQ2337546FDOQ2337546

Authors: Y. M. Fu, Ali Diabat 

Publication date: 20 November 2019

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2014.07.006

Recommendations

• A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results
• A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints
• Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
• Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals
• MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem

zbMATH Keywords

integer programmingLagrangian relaxationquay crane assignmentquay crane schedulingintegrated models

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• A crane scheduling method for port container terminals
• Container terminal operation and operations research -- a classification and literature review
• The quay crane scheduling problem with time windows
• Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
• A fast heuristic for quay crane scheduling with interference constraints
• A multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysis

Cited In (11)

• An integrated model for berth and yard planning in container terminals with multi-continuous berth layout
• An integrated supply chain problem: a nested Lagrangian relaxation approach
• Combinatorial approach to exactly solving discrete and hybrid berth allocation problem
• Metaheuristic-based Lagrangian relaxation for total weighted tardiness minimization
• Dynamic programming algorithms for the general quay crane double-cycling problem with internal-reshuffles
• Optimization for integrated scheduling of intelligent handling equipment with bidirectional flows and limited buffers at automated container terminals
• A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results
• Lagrangian relaxation of the generic materials and operations planning model
• Multiple crane scheduling in a batch annealing process with no-delay constraints for machine unloading
• An optimization model with a Lagrangian relaxation algorithm for artificial Internet of things-enabled sustainable circular supply chain networks
• A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints

This page was built for publication: A Lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem

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