The following pages link to Algorithm Theory - SWAT 2004 (Q5315384):
Displayed 13 items.
- On-line scheduling with non-crossing constraints (Q957355) (← links)
- A survey of berth allocation and quay crane scheduling problems in container terminals (Q1040981) (← links)
- The quay crane scheduling problem with non-crossing and safety clearance constraints: an exact solution approach (Q1738835) (← links)
- Approximate the scheduling of quay cranes with non-crossing constraints (Q1751714) (← links)
- Scheduling small number of quay cranes with non-interference constraint (Q2017842) (← links)
- An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem (Q2255903) (← links)
- Operations research at container terminals: a literature update (Q2480797) (← links)
- The quay crane scheduling problem with time windows (Q2892125) (← links)
- Approximation algorithm for uniform quay crane scheduling at container ports (Q3178146) (← links)
- Vehicle Routing Problems and Container Terminal Operations – An Update of Research (Q3564376) (← links)
- Some complexity results and an efficient algorithm for quay crane scheduling problem (Q5298341) (← links)
- A <i>m</i>‐parallel crane scheduling problem with a non‐crossing constraint (Q5436474) (← links)
- Handling uncertainty in the quay crane scheduling problem: a unified distributionally robust decision model (Q6187236) (← links)