A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules

DOI10.1007/s10288-013-0235-2zbMath1307.90096OpenAlexW1973064202MaRDI QIDQ742501

Pasquale Legato, Roberto Trunfio

Publication date: 18 September 2014

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-013-0235-2

zbMATH Keywords

schedulinglocal branchingbranch\&boundunidirectional schedules

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)

Related Items (8)

A follow-up survey of berth allocation and quay crane scheduling problems in container terminals ⋮ Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level ⋮ A generalized classification scheme for crane scheduling with interference ⋮ Handling uncertainty in the quay crane scheduling problem: a unified distributionally robust decision model ⋮ The quay crane scheduling problem with non-crossing and safety clearance constraints: an exact solution approach ⋮ Generalized local branching heuristics and the capacitated ring tree problem ⋮ A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints ⋮ Modelling and metaheuristic for gantry crane scheduling and storage space allocation problem in railway container terminals

Cites Work

• A tabu search heuristic for the quay crane scheduling problem
• Simulation-based optimization for discharge/loading operations at a maritime container terminal
• A survey of berth allocation and quay crane scheduling problems in container terminals
• Local branching
• Modeling and solving rich quay crane scheduling problems
• A crane scheduling method for port container terminals
• A fast heuristic for quay crane scheduling with interference constraints
• The crane scheduling problem: models and solution approaches
• Operations research at container terminals: a literature update
• The quay crane scheduling problem with time windows
• Crane scheduling with spatial constraints
• A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
• Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
• Tight bounds for the identical parallel machine scheduling problem
• Crane scheduling with non-crossing constraint
• Optimal Scheduling of Tasks on Identical Parallel Processors
• A m‐parallel crane scheduling problem with a non‐crossing constraint

This page was built for publication: A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules