The quay crane scheduling problem with time windows
From MaRDI portal
Recommendations
- A heuristic for the quay crane scheduling problem based on contiguous bay crane operations
- Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
- The crane scheduling problem: models and solution approaches
- A tabu search heuristic for the quay crane scheduling problem
- A crane scheduling method for port container terminals
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
- Algorithm Theory - SWAT 2004
- Crane scheduling with non-crossing constraint
- Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
Cited in
(26)- Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level
- Sequencing dual-spreader crane operations: mathematical formulation and heuristic algorithm
- A generalized classification scheme for crane scheduling with interference
- The study of the unidirectional quay crane scheduling problem: complexity and risk-aversion
- Modeling and solving rich quay crane scheduling problems
- A crane scheduling method for port container terminals
- Combining mixed integer programming and constraint programming to solve the integrated scheduling problem of container handling operations of a single vessel
- An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem
- Multiple crane scheduling in a batch annealing process with no-delay constraints for machine unloading
- Dynamic programming algorithms for the general quay crane double-cycling problem with internal-reshuffles
- 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
- The crane scheduling problem: models and solution approaches
- A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
- A heuristic for the quay crane scheduling problem based on contiguous bay crane operations
- Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
- Crane scheduling with time windows in circuit board production lines
- An algorithm based on makespan lower bound for quay crane schedule problem in container terminals
- A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints
- Scheduling quay cranes and shuttle vehicles simultaneously with limited apron buffer capacity
- The container premarshalling problem under limited crane time: a constraint programming approach
- Decomposition algorithms for the robust unidirectional quay crane scheduling problems
- Advances in multi-crane scheduling: extended non-interference modeling and temporal-constraint-based valid inequalities
- A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules
- A tabu search heuristic for the quay crane scheduling problem
- Container sequencing for quay cranes with internal reshuffles
This page was built for publication: The quay crane scheduling problem with time windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2892125)
