Approximation schemes for the crane scheduling problem
From MaRDI portal
Cited in
(20)- A survey of berth allocation and quay crane scheduling problems in container terminals
- Novel time-space network flow formulation and approximate dynamic programming approach for the crane scheduling in a coil warehouse
- A generalized classification scheme for crane scheduling with interference
- Approximation algorithms for the generalized stacker crane problem
- The quay crane scheduling problem with non-crossing and safety clearance constraints: an exact solution approach
- Approximate the scheduling of quay cranes with non-crossing constraints
- Scheduling small number of quay cranes with non-interference constraint
- An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem
- Operations research at container terminals: a literature update
- A beam search algorithm for minimizing crane times in premarshalling problems
- The quay crane scheduling problem with time windows
- Approximation algorithm for uniform quay crane scheduling at container ports
- Vehicle Routing Problems and Container Terminal Operations – An Update of Research
- Some complexity results and an efficient algorithm for quay crane scheduling problem
- A m‐parallel crane scheduling problem with a non‐crossing constraint
- Approximation algorithms for some min-max and minimum stacker crane cover problems
- Handling uncertainty in the quay crane scheduling problem: a unified distributionally robust decision model
- Scheduling double-track gantry cranes to minimize the overall loading/unloading time
- Decomposition algorithms for the robust unidirectional quay crane scheduling problems
- On-line scheduling with non-crossing constraints
This page was built for publication: Approximation schemes for the crane scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5315384)