An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability
From MaRDI portal
Publication:2029972
Recommendations
- Exact and heuristic methods for the integrated berth allocation and specific time-invariant quay crane assignment problems
- The quay crane scheduling problem with non-crossing and safety clearance constraints: an exact solution approach
- Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level
- A crane scheduling method for port container terminals
- An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem
Cites work
- scientific article; zbMATH DE number 1550909 (Why is no real title available?)
- A Benders decomposition-based framework for solving quay crane scheduling problems
- A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints
- 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 follow-up survey of berth allocation and quay crane scheduling problems in container terminals
- A survey of berth allocation and quay crane scheduling problems in container terminals
- An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Logic-based Benders decomposition
- Modeling and solving rich quay crane scheduling problems
- Operations research at container terminals: a literature update
- Partitioning procedures for solving mixed-variables programming problems
- Planning and Scheduling by Logic-Based Benders Decomposition
- Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
- The crane scheduling problem: models and solution approaches
- The study of the unidirectional quay crane scheduling problem: complexity and risk-aversion
- Transshipment of containers at a container terminal: An overview
Cited in
(16)- 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 decomposition method for the group-based quay crane scheduling problem
- Exact and heuristic methods for the integrated berth allocation and specific time-invariant quay crane assignment problems
- Scheduling in manufacturing with transportation: classification and solution techniques
- Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level
- Scheduling quay cranes and shuttle vehicles simultaneously with limited apron buffer capacity
- Dynamic programming algorithms for the general quay crane double-cycling problem with internal-reshuffles
- Unrelated parallel machine scheduling problem with special controllable processing times and setups
- A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules
- Handling uncertainty in the quay crane scheduling problem: a unified distributionally robust decision model
- The study of the unidirectional quay crane scheduling problem: complexity and risk-aversion
- A collaborative decision support framework for sustainable cargo composition in container shipping services
- An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem
- Simultaneous operation of next-generation and traditional quay cranes at container terminals
- The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions
This page was built for publication: An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2029972)