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

DOI10.1007/S10288-013-0235-2MaRDI QIDQ742501zbMATH OpenOpenAlexFDO

Authors 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) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90) Transportation, logistics and supply chain management (90B06)

Recommendations

• An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability
• A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
• Some complexity results and an efficient algorithm for quay crane scheduling problem
• The study of the unidirectional quay crane scheduling problem: complexity and risk-aversion
• An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem
• A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results
• A Benders decomposition-based framework for solving quay crane scheduling problems
• A branch-and-cut algorithm for factory crane scheduling problem
• Approximation algorithms of quay crane scheduling with non-interference constraints

Cites work

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

Cited in

(17)

• Decomposition algorithms for the robust unidirectional quay crane scheduling problems
• The quay crane scheduling problem with non-crossing and safety clearance constraints: an exact solution approach
• A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
• A tabu search heuristic for the quay crane scheduling problem
• Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level
• Modelling and metaheuristic for gantry crane scheduling and storage space allocation problem in railway container terminals
• Handling uncertainty in the quay crane scheduling problem: a unified distributionally robust decision model
• Simulation-based optimization for discharge/loading operations at a maritime container terminal
• An algorithm based on makespan lower bound for quay crane schedule problem in container terminals
• A Benders decomposition-based framework for solving quay crane scheduling problems
• The study of the unidirectional quay crane scheduling problem: complexity and risk-aversion
• Modeling and solving rich quay crane scheduling problems
• Generalized local branching heuristics and the capacitated ring tree problem
• A generalized classification scheme for crane scheduling with interference
• An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem
• A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints
• Scheduling double-track gantry cranes to minimize the overall loading/unloading time

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

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