Pruning rules for optimal runway sequencing
Year of publication: |
July-August 2018
|
---|---|
Authors: | De Maere, Geert ; Atkin, Jason A. D. ; Burke, Edmund K. |
Published in: |
Transportation science : a journal of the Institute for Operations Research and the Management Sciences. - Catonsville, MD : Transportation Science & Logistics Society of the Institute for Operations Research and the Management Sciences, ISSN 0041-1655, ZDB-ID 160958-0. - Vol. 52.2018, 4, p. 898-916
|
Subject: | dynamic programming | runway sequencing | machine scheduling | sequence dependent setup times | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Dynamische Optimierung | Dynamic programming | Produktionssteuerung | Production control | Mathematische Optimierung | Mathematical programming | Durchlaufzeit | Lead time | Algorithmus | Algorithm |
-
Bounded dynamic programming algorithm for the job shop problem with sequence dependent setup times
Ozolins, Ansis, (2020)
-
A new exact algorithm for no-wait job shop problem to minimize makespan
Ozolins, Aija, (2020)
-
Approximate dynamic programming for an energy-efficient parallel machine scheduling problem
Heydar, Mojtaba, (2022)
- More ...
-
Addressing the pushback time allocation problem at Heathrow airport
Atkin, Jason A. D., (2013)
-
A multi-objective approach for robust airline scheduling
Burke, Edmund K., (2010)
-
A comparison of two methods for reducing take-off delay at London Heathrow airport
Atkin, Jason A. D., (2011)
- More ...