An analysis of constructive algorithms for the airport baggage sorting station assignment problem
From MaRDI portal
Publication:490384
DOI10.1007/S10951-013-0361-XzbMath1305.90172OpenAlexW1981620416MaRDI QIDQ490384
Amadeo Ascó, Jason A. D. Atkin, Edmund Kieran Burke
Publication date: 22 January 2015
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-013-0361-x
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (4)
An analysis of robustness approaches for the airport baggage sorting station assignment problem ⋮ Scheduling shipments in closed-loop sortation conveyors ⋮ Automated sortation conveyors: a survey from an operational research perspective ⋮ An analysis of constructive algorithms for the airport baggage sorting station assignment problem
Uses Software
Cites Work
- Unnamed Item
- An analysis of constructive algorithms for the airport baggage sorting station assignment problem
- Looking ahead with the pilot method
- On-line decision support for take-off runway scheduling with uncertain taxi times at London heathrow airport
- Procedures for providing robust gate assignments for arriving aircrafts
- The over-constrained airport gate assignment problem
- Robust Optimization of Large-Scale Systems
This page was built for publication: An analysis of constructive algorithms for the airport baggage sorting station assignment problem