Approximation algorithms of quay crane scheduling with non-interference constraints
From MaRDI portal
Recommendations
- Scheduling small number of quay cranes with non-interference constraint
- Approximate the scheduling of quay cranes with non-crossing constraints
- Approximation algorithm for uniform quay crane scheduling at container ports
- A fast heuristic for quay crane scheduling with interference constraints
- An algorithm based on makespan lower bound for quay crane schedule problem in container terminals
Cited in
(13)- A generalized classification scheme for crane scheduling with interference
- Approximate the scheduling of quay cranes with non-crossing constraints
- Scheduling reclaimer operations in the stockyard to minimize makespan
- A multiple-crane-constrained scheduling problem in a container terminal
- Scheduling small number of quay cranes with non-interference constraint
- A fast heuristic for quay crane scheduling with interference constraints
- Dynamic programming algorithms for the general quay crane double-cycling problem with internal-reshuffles
- Approximation algorithm for uniform quay crane scheduling at container ports
- Crane scheduling with non-crossing constraint
- An algorithm based on makespan lower bound for quay crane schedule problem in container terminals
- Some complexity results and an efficient algorithm for quay crane scheduling problem
- A m‐parallel crane scheduling problem with a non‐crossing constraint
- A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules
This page was built for publication: Approximation algorithms of quay crane scheduling with non-interference constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2983631)
