Decomposition algorithms for the robust unidirectional quay crane scheduling problems

Cites Work

Title not available (Why is that?)
A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules
A tabu search heuristic for the quay crane scheduling problem
A survey of berth allocation and quay crane scheduling problems in container terminals
Partitioning procedures for solving mixed-variables programming problems
Container terminal operation and operations research -- a classification and literature review
Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level
The quay crane scheduling problem with non-crossing and safety clearance constraints: an exact solution approach
The study of the unidirectional quay crane scheduling problem: complexity and risk-aversion
Modeling and solving rich quay crane scheduling problems
Transshipment of containers at a container terminal: An overview
A crane scheduling method for port container terminals
A two-stage robust model for a reliable \(p\)-center facility location problem
An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability
Berth allocation and quay crane assignment/scheduling problem under uncertainty: a survey
A robust multiobjective model for the integrated berth and quay crane scheduling problem at seaside container terminals
An exact robust approach for the integrated berth allocation and quay crane scheduling problem under uncertain arrival times
An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem
A fast heuristic for quay crane scheduling with interference constraints
Solving two-stage robust optimization problems using a column-and-constraint generation method
Operations research at container terminals: a literature update
The quay crane scheduling problem with time windows
Introduction to Stochastic Programming
Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
Benders Decomposition for Production Routing Under Demand Uncertainty
The Price of Robustness
Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
Algorithm Theory - SWAT 2004
A m‐parallel crane scheduling problem with a non‐crossing constraint
Handling uncertainty in the quay crane scheduling problem: a unified distributionally robust decision model

This page was built for publication: Decomposition algorithms for the robust unidirectional quay crane scheduling problems

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