On-line scheduling with non-crossing constraints
From MaRDI portal
Publication:957355
DOI10.1016/j.orl.2008.04.005zbMath1210.90096OpenAlexW2106461756MaRDI QIDQ957355
Kwanniti Khammuang, Andrew Wirth, LeLe Zhang
Publication date: 27 November 2008
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2008.04.005
Related Items (7)
A follow-up survey of berth allocation and quay crane scheduling problems in container terminals ⋮ Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level ⋮ Online Integrated Allocation of Berths and Quay Cranes in Container Terminals with 1-Lookahead ⋮ A generalized classification scheme for crane scheduling with interference ⋮ A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints ⋮ An Online Model of Berth and Quay Crane Integrated Allocation in Container Terminals ⋮ Online integrated allocation of berths and quay cranes in container terminals with 1-lookahead
Cites Work
- Scheduling on identical machines: How good is LPT in an on-line setting?
- Container terminal operation and operations research -- a classification and literature review
- Crane scheduling with spatial constraints
- Crane scheduling with non-crossing constraint
- Algorithm Theory - SWAT 2004
- A m‐parallel crane scheduling problem with a non‐crossing constraint
This page was built for publication: On-line scheduling with non-crossing constraints
