IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v189y2008i3p1254-1266.html
   My bibliography  Save this article

Runway sequencing with holding patterns

Author

Listed:
  • Artiouchine, Konstantin
  • Baptiste, Philippe
  • Dürr, Christoph

Abstract

We study a scheduling problem, motivated by air-traffic control. When aircraft reach the final descent in the "Terminal Radar Approach CONontrol" area (tracon), a set of disjoint time windows in which the landing is possible, can be automatically assigned to each aircraft. The objective is then to determine landing times, within these time windows, which maximize the minimum time elapsed between consecutive landings. We study the complexity of the problem and describe several special cases that can be solved in polynomial time. We also provide a compact Mixed Integer Programming formulation that allows us to solve large instances of the general problem when all time windows have the same size. Finally, we introduce a general hybrid branch and cut framework to solve the problem with arbitrary time windows. Experimental results show that our approach outperforms earlier formulation of the problem.

Suggested Citation

  • Artiouchine, Konstantin & Baptiste, Philippe & Dürr, Christoph, 2008. "Runway sequencing with holding patterns," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1254-1266, September.
    • Handle: RePEc:eee:ejores:v:189:y:2008:i:3:p:1254-1266
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(07)00597-8
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. SADYKOV, Rusland & WOLSEY, Laurence, 2003. "Integer programming and constraint programming in solving a multi-machine assignment scheduling problem with deadlines and release dates," LIDAM Discussion Papers CORE 2003081, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Matteo Fischetti & Silvano Martello & Paolo Toth, 1992. "Approximation Algorithms for Fixed Job Schedule Problems," Operations Research, INFORMS, vol. 40(1-supplem), pages 96-108, February.
    3. Kroon, Leo G. & Salomon, Marc & Van Wassenhove, Luk N., 1995. "Exact and approximation algorithms for the operational fixed interval scheduling problem," European Journal of Operational Research, Elsevier, vol. 82(1), pages 190-205, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Marie-Sklaerder Vié & Nicolas Zufferey & Roel Leus, 2022. "Aircraft landing planning under uncertain conditions," Journal of Scheduling, Springer, vol. 25(2), pages 203-228, April.
    2. Samà, Marcella & D’Ariano, Andrea & D’Ariano, Paolo & Pacciarelli, Dario, 2017. "Scheduling models for optimal aircraft traffic control at busy airports: Tardiness, priorities, equity and violations considerations," Omega, Elsevier, vol. 67(C), pages 81-98.
    3. Ghoniem, Ahmed & Farhadi, Farbod & Reihaneh, Mohammad, 2015. "An accelerated branch-and-price algorithm for multiple-runway aircraft sequencing problems," European Journal of Operational Research, Elsevier, vol. 246(1), pages 34-43.
    4. Samà, Marcella & D'Ariano, Andrea & Corman, Francesco & Pacciarelli, Dario, 2018. "Coordination of scheduling decisions in the management of airport airspace and taxiway operations," Transportation Research Part A: Policy and Practice, Elsevier, vol. 114(PB), pages 398-411.
    5. Marcella Samà & Andrea D’Ariano & Konstantin Palagachev & Matthias Gerdts, 2019. "Integration methods for aircraft scheduling and trajectory optimization at a busy terminal manoeuvring area," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(3), pages 641-681, September.
    6. Bennell, Julia A. & Mesgarpour, Mohammad & Potts, Chris N., 2017. "Dynamic scheduling of aircraft landings," European Journal of Operational Research, Elsevier, vol. 258(1), pages 315-327.
    7. Gwiggner, Claus & Nagaoka, Sakae, 2014. "Data and queueing analysis of a Japanese air-traffic flow," European Journal of Operational Research, Elsevier, vol. 235(1), pages 265-275.
    8. Chandra, Aitichya & Choubey, Nipun & Verma, Ashish & Sooraj, K.P., 2024. "Quasi-stochastic optimization model for time-based arrival scheduling considering Standard Terminal Arrival (STAR) track time and a new delay-conflict relationship," Journal of Air Transport Management, Elsevier, vol. 115(C).
    9. Faye, Alain, 2015. "Solving the Aircraft Landing Problem with time discretization approach," European Journal of Operational Research, Elsevier, vol. 242(3), pages 1028-1038.
    10. Julia Bennell & Mohammad Mesgarpour & Chris Potts, 2013. "Airport runway scheduling," Annals of Operations Research, Springer, vol. 204(1), pages 249-270, April.
    11. Lieder, Alexander & Briskorn, Dirk & Stolletz, Raik, 2015. "A dynamic programming approach for the aircraft landing problem with aircraft classes," European Journal of Operational Research, Elsevier, vol. 243(1), pages 61-69.
    12. Ng, K.K.H. & Lee, C.K.M. & Chan, Felix T.S. & Qin, Yichen, 2017. "Robust aircraft sequencing and scheduling problem with arrival/departure delay using the min-max regret approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 115-136.
    13. Rodríguez-Díaz, A. & Adenso-Díaz, B. & González-Torre, P.L., 2019. "Improving aircraft approach operations taking into account noise and fuel consumption," Journal of Air Transport Management, Elsevier, vol. 77(C), pages 46-56.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Türsel Eliiyi, Deniz & Azizoglu, Meral, 2011. "Heuristics for operational fixed job scheduling problems with working and spread time constraints," International Journal of Production Economics, Elsevier, vol. 132(1), pages 107-121, July.
    2. Yim, Seho & Hong, Sung-Pil & Park, Myoung-Ju & Chung, Yerim, 2022. "Inverse interval scheduling via reduction on a single machine," European Journal of Operational Research, Elsevier, vol. 303(2), pages 541-549.
    3. Antoon W.J. Kolen & Jan Karel Lenstra & Christos H. Papadimitriou & Frits C.R. Spieksma, 2007. "Interval scheduling: A survey," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(5), pages 530-543, August.
    4. Bekki, Özgün BarIs & Azizoglu, Meral, 2008. "Operational fixed interval scheduling problem on uniform parallel machines," International Journal of Production Economics, Elsevier, vol. 112(2), pages 756-768, April.
    5. Slotnick, Susan A., 2011. "Order acceptance and scheduling: A taxonomy and review," European Journal of Operational Research, Elsevier, vol. 212(1), pages 1-11, July.
    6. Kroon, Leo G. & Salomon, Marc & Van Wassenhove, Luk N., 1995. "Exact and approximation algorithms for the operational fixed interval scheduling problem," European Journal of Operational Research, Elsevier, vol. 82(1), pages 190-205, April.
    7. Kovalyov, Mikhail Y. & Ng, C.T. & Cheng, T.C. Edwin, 2007. "Fixed interval scheduling: Models, applications, computational complexity and algorithms," European Journal of Operational Research, Elsevier, vol. 178(2), pages 331-342, April.
    8. Bahel, Eric & Trudeau, Christian, 2019. "Stability and fairness in the job scheduling problem," Games and Economic Behavior, Elsevier, vol. 117(C), pages 1-14.
    9. Zhi-Long Chen, 2010. "Integrated Production and Outbound Distribution Scheduling: Review and Extensions," Operations Research, INFORMS, vol. 58(1), pages 130-148, February.
    10. Arpan Rijal & Marco Bijvank & Asvin Goel & René de Koster, 2021. "Workforce Scheduling with Order-Picking Assignments in Distribution Facilities," Transportation Science, INFORMS, vol. 55(3), pages 725-746, May.
    11. Chuangyin Dang & Liying Kang, 2004. "Batch-Processing Scheduling with Setup Times," Journal of Combinatorial Optimization, Springer, vol. 8(2), pages 137-146, June.
    12. Kroon, Leo G. & Edwin Romeijn, H. & Zwaneveld, Peter J., 1997. "Routing trains through railway stations: complexity issues," European Journal of Operational Research, Elsevier, vol. 98(3), pages 485-498, May.
    13. Gedik, Ridvan & Rainwater, Chase & Nachtmann, Heather & Pohl, Ed A., 2016. "Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals," European Journal of Operational Research, Elsevier, vol. 251(2), pages 640-650.
    14. Janiak, Adam & Janiak, Władysław A. & Krysiak, Tomasz & Kwiatkowski, Tomasz, 2015. "A survey on scheduling problems with due windows," European Journal of Operational Research, Elsevier, vol. 242(2), pages 347-357.
    15. Martin Branda & Štěpán Hájek, 2017. "Flow-based formulations for operational fixed interval scheduling problems with random delays," Computational Management Science, Springer, vol. 14(1), pages 161-177, January.
    16. Zhang, Xiandong & (Yale) Gong, Yeming & Zhou, Shuyu & de Koster, René & van de Velde, Steef, 2016. "Increasing the revenue of self-storage warehouses by optimizing order scheduling," European Journal of Operational Research, Elsevier, vol. 252(1), pages 69-78.
    17. Krishnamoorthy, M. & Ernst, A.T. & Baatar, D., 2012. "Algorithms for large scale Shift Minimisation Personnel Task Scheduling Problems," European Journal of Operational Research, Elsevier, vol. 219(1), pages 34-48.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:189:y:2008:i:3:p:1254-1266. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.