{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:33:43Z","timestamp":1740123223268,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,11,23]],"date-time":"2024-11-23T00:00:00Z","timestamp":1732320000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,23]],"date-time":"2024-11-23T00:00:00Z","timestamp":1732320000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s10479-024-06358-x","type":"journal-article","created":{"date-parts":[[2024,11,23]],"date-time":"2024-11-23T06:47:28Z","timestamp":1732344448000},"page":"479-498","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A near-linear time algorithm and a min-cost flow approach for determining the optimal landing times of a fixed sequence of planes"],"prefix":"10.1007","volume":"344","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0368-9232","authenticated-orcid":false,"given":"Bin","family":"Cao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,23]]},"reference":[{"issue":"3","key":"6358_CR1","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/s00291-019-00562-z","volume":"41","author":"J Atkin","year":"2019","unstructured":"Atkin, J., Hoogeveen, H., & Stolletz, R. (2019). Airport operations management. OR Spectrum, 41(3), 613. https:\/\/doi.org\/10.1007\/s00291-019-00562-z","journal-title":"OR Spectrum"},{"issue":"6","key":"6358_CR2","doi-asserted-by":"publisher","first-page":"1650","DOI":"10.1287\/opre.1100.0869","volume":"58","author":"H Balakrishnan","year":"2010","unstructured":"Balakrishnan, H., & Chandran, B. G. (2010). Algorithms for scheduling runway operations under constrained position shifting. Operations Research, 58(6), 1650.","journal-title":"Operations Research"},{"issue":"4","key":"6358_CR3","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/BF02404002","volume":"8","author":"JE Beasley","year":"1996","unstructured":"Beasley, J. E. (1996). Obtaining test problems via internet. Journal of Global Optimization, 8(4), 429. https:\/\/doi.org\/10.1007\/BF02404002","journal-title":"Journal of Global Optimization"},{"issue":"2","key":"6358_CR4","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/trsc.34.2.180.12302","volume":"34","author":"JE Beasley","year":"2000","unstructured":"Beasley, J. E., Krishnamoorthy, M., Sharaiha, Y. M., & Abramson, D. (2000). Scheduling aircraft landings Science. Transportation science, 34(2), 180. https:\/\/doi.org\/10.1287\/trsc.34.2.180.12302","journal-title":"Transportation science"},{"issue":"1","key":"6358_CR5","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1057\/palgrave.jors.2601650","volume":"55","author":"JE Beasley","year":"2004","unstructured":"Beasley, J. E., Krishnamoorthy, M., Sharaiha, Y. M., & Abramson, D. (2004). Displacement problem and dynamically scheduling aircraft landings. The Journal of the Operational Research Society, 55(1), 54.","journal-title":"The Journal of the Operational Research Society"},{"issue":"5","key":"6358_CR6","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1057\/palgrave.jors.2601129","volume":"52","author":"JE Beasley","year":"2001","unstructured":"Beasley, J. E., Sonander, J., & Havelock, P. (2001). Scheduling aircraft landings at London heathrow using a population heuristic. Journal of the Operational Research Society, 52(5), 483. https:\/\/doi.org\/10.1057\/palgrave.jors.2601129","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"6358_CR7","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10479-012-1268-1","volume":"204","author":"JA Bennell","year":"2013","unstructured":"Bennell, J. A., Mesgarpour, M., & Potts, C. N. (2013). Airport runway scheduling. Annals of Operations Research, 204(1), 249. https:\/\/doi.org\/10.1007\/s10479-012-1268-1","journal-title":"Annals of Operations Research"},{"issue":"1","key":"6358_CR8","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.ejor.2016.08.015","volume":"258","author":"JA Bennell","year":"2017","unstructured":"Bennell, J. A., Mesgarpour, M., & Potts, C. N. (2017). Dynamic scheduling of aircraft landings. European Journal of Operational Research, 258(1), 315. https:\/\/doi.org\/10.1016\/j.ejor.2016.08.015","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"6358_CR9","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/s10951-006-6779-7","volume":"9","author":"L Bianco","year":"2006","unstructured":"Bianco, L., Dell\u2019Olmo, P., & Giordani, S. (2006). Scheduling models for air traffic control in terminal areas. Journal of Scheduling, 9(3), 2. https:\/\/doi.org\/10.1007\/s10951-006-6779-7","journal-title":"Journal of Scheduling"},{"issue":"3","key":"6358_CR10","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1006\/jagm.1993.1048","volume":"15","author":"H Booth","year":"1993","unstructured":"Booth, H., & Tarjan, R. (1993). Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network. Journal of Algorithms, 15(3), 416. https:\/\/doi.org\/10.1006\/jagm.1993.1048","journal-title":"Journal of Algorithms"},{"key":"6358_CR11","doi-asserted-by":"publisher","unstructured":"Brand, J.\u00a0V.\u00a0D., Chen, L., Kyng, R., Liu, Y.\u00a0P., Peng, R., Gutenberg, M.\u00a0P., Sachdeva, S., & Sidford, A. (2023). A deterministic almost-linear time algorithm for minimum-cost Annual Symposium on Foundations of Computer Science (FOCS), 503 https:\/\/doi.org\/10.1109\/FOCS57990.2023.00037","DOI":"10.1109\/FOCS57990.2023.00037"},{"key":"6358_CR12","unstructured":"Brentnall, A. R. (2006). Aircraft arrival management [Doctoral dissertation, University of Southampton]. United Kingdom: Southampton."},{"issue":"4","key":"6358_CR13","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1049\/iet-its.2011.0182","volume":"6","author":"A D\u2019Ariano","year":"2012","unstructured":"D\u2019Ariano, A., Pistelli, M., & Pacciarelli, D. (2012). Aircraft retiming and rerouting in vicinity of airports. IET Intelligent Transport Systems, 6(4), 433. https:\/\/doi.org\/10.1049\/iet-its.2011.0182","journal-title":"IET Intelligent Transport Systems"},{"issue":"1","key":"6358_CR14","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0890-5401(92)90041-D","volume":"98","author":"D Eppstein","year":"1992","unstructured":"Eppstein, D. (1992). Parallel recognition of series-parallel graphs. Information and Computation, 98(1), 41. https:\/\/doi.org\/10.1016\/0890-5401(92)90041-D","journal-title":"Information and Computation"},{"issue":"3","key":"6358_CR15","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1002\/(SICI)1097-0037(199910)34:3<229::AID-NET8>3.0.CO;2-W","volume":"34","author":"AT Ernst","year":"1999","unstructured":"Ernst, A. T., Krishnamoorthy, M., & Storer, R. H. (1999). Heuristic and exact algorithms for scheduling aircraft landings. Networks, 34(3), 229. https:\/\/doi.org\/10.1002\/(SICI)1097-0037(199910)34:3<229::AID-NET8>3.0.CO;2-W","journal-title":"Networks"},{"key":"6358_CR16","doi-asserted-by":"publisher","unstructured":"Fahle, T., Feldmann, R., G\u00f6tz, S., Grothklags, S., & Monien, B. (2003). The aircraft sequencing problem. In R. Klein, H.-W. Six, & L. Wegner (Eds.), Computer science in perspective: Essays dedicated to thomas ottmann (pp.\u00a0152 https:\/\/doi.org\/10.1007\/3-540-36477-3_11","DOI":"10.1007\/3-540-36477-3_11"},{"issue":"3","key":"6358_CR17","doi-asserted-by":"publisher","first-page":"1028","DOI":"10.1016\/j.ejor.2014.10.064","volume":"242","author":"A Faye","year":"2015","unstructured":"Faye, A. (2015). Solving the aircraft landing problem with time discretization approach. European Journal of Operational Research, 242(3), 1028. https:\/\/doi.org\/10.1016\/j.ejor.2014.10.064","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"6358_CR18","doi-asserted-by":"publisher","first-page":"1148","DOI":"10.1016\/j.ejor.2018.04.021","volume":"270","author":"A Faye","year":"2018","unstructured":"Faye, A. (2018). A quadratic time algorithm for computing the optimal landing times of a Horizons]. European Journal of Operational Research, 270(3), 1148. https:\/\/doi.org\/10.1016\/j.ejor.2018.04.021","journal-title":"European Journal of Operational Research"},{"issue":"10","key":"6358_CR19","doi-asserted-by":"publisher","first-page":"1717","DOI":"10.1057\/jors.2014.131","volume":"66","author":"A Ghoniem","year":"2015","unstructured":"Ghoniem, A., & Farhadi, F. (2015). A column generation approach for aircraft sequencing problems: A computational study. Journal of the Operational Research Society, 66(10), 1717. https:\/\/doi.org\/10.1057\/jors.2014.131","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"6358_CR20","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.ejor.2015.04.019","volume":"246","author":"A Ghoniem","year":"2015","unstructured":"Ghoniem, A., Farhadi, F., & Reihaneh, M. (2015). An accelerated branch-and-price algorithm for multiple-runway aircraft sequencing problems. European Journal of Operational Research, 246(1), 34. https:\/\/doi.org\/10.1016\/j.ejor.2015.04.019","journal-title":"European Journal of Operational Research"},{"key":"6358_CR21","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.jairtraman.2013.06.001","volume":"32","author":"G Hancerliogullari","year":"2013","unstructured":"Hancerliogullari, G., Rabadi, G., Al-Salem, A. H., & Kharbeche, M. (2013). Greedy algorithms and metaheuristics for a multiple runway combined arrival-departure aircraft sequencing problem. Journal of Air Transport Management, 32, 39. https:\/\/doi.org\/10.1016\/j.jairtraman.2013.06.001","journal-title":"Journal of Air Transport Management"},{"issue":"3","key":"6358_CR22","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/S0305-0548(02)00228-9","volume":"31","author":"JV Hansen","year":"2004","unstructured":"Hansen, J. V. (2004). Genetic search methods in air tra. Computers & Operations Research, 31(3), 445. https:\/\/doi.org\/10.1016\/S0305-0548(02)00228-9","journal-title":"Computers & Operations Research"},{"key":"6358_CR23","doi-asserted-by":"publisher","first-page":"105336","DOI":"10.1016\/j.cor.2021.105336","volume":"132","author":"S Ikli","year":"2021","unstructured":"Ikli, S., Mancel, C., Mongeau, M., Olive, X., & Rachelson, E. (2021). The aircraft runway scheduling problem: A survey. Computers & Operations Research, 132, 105336. https:\/\/doi.org\/10.1016\/j.cor.2021.105336","journal-title":"Computers & Operations Research"},{"issue":"23","key":"6358_CR24","doi-asserted-by":"publisher","first-page":"7021","DOI":"10.1007\/s00500-016-2241-8","volume":"21","author":"X-P Ji","year":"2017","unstructured":"Ji, X.-P., Cao, X.-B., Du, W.-B., & Tang, K. (2017). An evolutionary approach for dynamic single-runway arrival sequencing and scheduling problem. Soft Computing, 21(23), 7021. https:\/\/doi.org\/10.1007\/s00500-016-2241-8","journal-title":"Soft Computing"},{"issue":"1","key":"6358_CR25","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.ejor.2014.11.027","volume":"243","author":"A Lieder","year":"2015","unstructured":"Lieder, A., Briskorn, D., & Stolletz, R. (2015). A dynamic programming approach for the aircraft landing problem with aircraft classes. European Journal of Operational Research, 243(1), 61. https:\/\/doi.org\/10.1016\/j.ejor.2014.11.027","journal-title":"European Journal of Operational Research"},{"key":"6358_CR26","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.tre.2016.01.015","volume":"88","author":"A Lieder","year":"2016","unstructured":"Lieder, A., & Stolletz, R. (2016). Scheduling aircraft take-o landings on interdependent and heterogeneous runways. Transportation Research Part E: Logistics and Transportation Review, 88, 167. https:\/\/doi.org\/10.1016\/j.tre.2016.01.015","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"6358_CR27","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.tre.2017.08.006","volume":"106","author":"K Ng","year":"2017","unstructured":"Ng, K., Lee, C., Chan, F. T., & Qin, Y. (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, 106, 115. https:\/\/doi.org\/10.1016\/j.tre.2017.08.006","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"2","key":"6358_CR28","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/j.ejor.2004.09.040","volume":"171","author":"H Pinol","year":"2006","unstructured":"Pinol, H., & Beasley, J. (2006). Scatter search and bionomic algorithms for the aircraft landing problem. European Journal of Operational Research, 171(2), 439. https:\/\/doi.org\/10.1016\/j.ejor.2004.09.040","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"6358_CR29","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1287\/opre.28.6.1347","volume":"28","author":"HN Psaraftis","year":"1980","unstructured":"Psaraftis, H. N. (1980). A dynamic programming approach for sequencing groups of identical jobs. Operations Research, 28(6), 1347. https:\/\/doi.org\/10.1287\/opre.28.6.1347","journal-title":"Operations Research"},{"key":"6358_CR30","unstructured":"Psaraftis, H.N. (1978). A dynamic programming approach to the aircraft sequencing problem (tech. rep.). Massachusetts Institute of Technology, Flight Transportation Laboratory. Cambridge, Massachusetts."},{"key":"6358_CR31","doi-asserted-by":"publisher","unstructured":"Rote, G. (2018). Isotonic Regression by Dynamic Programming. In J.\u00a0T. Fineman & M. Mitzenmacher (Eds.), 2nd symposium on simplicity in algorithms (sosa 2019) (1:1\u20131:18) Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik. https:\/\/doi.org\/10.4230\/OASIcs.SOSA.2019.1 Keywords: Convex functions, dynamic programming, convex hull, isotonic regression.","DOI":"10.4230\/OASIcs.SOSA.2019.1"},{"key":"6358_CR32","volume-title":"Data structures, algorithms, and applications in java","author":"S Sahni","year":"2004","unstructured":"Sahni, S. (2004). Data structures, algorithms, and applications in java. Silicon Press."},{"issue":"1","key":"6358_CR33","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.cor.2012.06.004","volume":"40","author":"A Salehipour","year":"2013","unstructured":"Salehipour, A., Modarres, M., & Naeni, L. M. (2013). An e meta-heuristic for aircraft landing problem. Computers & Operations Research, 40(1), 207. https:\/\/doi.org\/10.1016\/j.cor.2012.06.004","journal-title":"Computers & Operations Research"},{"issue":"3","key":"6358_CR34","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s00291-019-00560-1","volume":"41","author":"M Sama","year":"2019","unstructured":"Sama, M., D\u2019Ariano, A., Palagachev, K., & Gerdts, M. (2019). Integration methods for aircraft scheduling and trajectory optimization at a busy terminal Manoeuvring area. OR Spectrum, 41(3), 641.","journal-title":"OR Spectrum"},{"issue":"1","key":"6358_CR35","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.ejor.2007.06.017","volume":"190","author":"M Soomer","year":"2008","unstructured":"Soomer, M., & Franx, G. (2008). Scheduling aircraft landings using airlines\u2019 preferences. European Journal of Operational Research, 190(1), 277. https:\/\/doi.org\/10.1016\/j.ejor.2007.06.017","journal-title":"European Journal of Operational Research"},{"key":"6358_CR36","unstructured":"Xu, C. (2019). Airplane.java. https:\/\/gist.github.com\/chaoxu\/a92e1f8e7e4c89b37a5f962451689a0d"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-06358-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-024-06358-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-06358-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,3]],"date-time":"2025-01-03T02:12:11Z","timestamp":1735870331000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-024-06358-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,23]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["6358"],"URL":"https:\/\/doi.org\/10.1007\/s10479-024-06358-x","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2024,11,23]]},"assertion":[{"value":"17 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 October 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 November 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No potential Conflict of interest was reported by the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}