Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
From MaRDI portal
Publication:3423265
DOI10.1002/nav.20108zbMath1112.90031OpenAlexW2159548533MaRDI QIDQ3423265
Lei Wang, Jiyin Liu, Yat-Wah Wan
Publication date: 20 February 2007
Published in: Naval Research Logistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.20108
integer programmingheuristic approachcontainer terminalquay crane schedulingvessel discharge/loading
Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (34)
A Benders decomposition-based framework for solving quay crane scheduling problems ⋮ The quay crane scheduling problem with time windows ⋮ Some complexity results and an efficient algorithm for quay crane scheduling problem ⋮ Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals ⋮ Compact ILP formulations for a class of solutions to berth allocation and quay crane scheduling problems ⋮ A heuristic for the quay crane scheduling problem based on contiguous bay crane operations ⋮ A reclaimer scheduling problem arising in coal stockyard management ⋮ The crane scheduling problem: models and solution approaches ⋮ Simultaneous Allocation of Berths and Quay Cranes under Discrete Berth Situation ⋮ Combining mixed integer programming and constraint programming to solve the integrated scheduling problem of container handling operations of a single vessel ⋮ Pallet location and job scheduling in a twin-robot system ⋮ MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem ⋮ A generalized classification scheme for crane scheduling with interference ⋮ Handling uncertainty in the quay crane scheduling problem: a unified distributionally robust decision model ⋮ An integrated berth allocation and yard assignment problem for bulk ports: Formulation and case study ⋮ Multi objective optimization of coordinated scheduling of cranes and vehicles at container terminals ⋮ An evolutionary approach to a combined mixed integer programming model of seaside operations as arise in container ports ⋮ Scheduling quay cranes and yard trucks for unloading operations in container ports ⋮ The study of the unidirectional quay crane scheduling problem: complexity and risk-aversion ⋮ Operations research at container terminals: a literature update ⋮ An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem ⋮ Optimal berth allocation and time-invariant quay crane assignment in container terminals ⋮ Modeling and solving rich quay crane scheduling problems ⋮ A fast heuristic for quay crane scheduling with interference constraints ⋮ Container sequencing for quay cranes with internal reshuffles ⋮ Simulation-based optimization for discharge/loading operations at a maritime container terminal ⋮ An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability ⋮ Modeling and solution of the joint quay crane and truck scheduling problem ⋮ Multiple crane scheduling in a batch annealing process with no-delay constraints for machine unloading ⋮ A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules ⋮ Scheduling of a single crane in batch annealing process ⋮ A survey of berth allocation and quay crane scheduling problems in container terminals ⋮ 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
This page was built for publication: Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures