{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T13:37:05Z","timestamp":1744205825191,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,11,20]],"date-time":"2021-11-20T00:00:00Z","timestamp":1637366400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,20]],"date-time":"2021-11-20T00:00:00Z","timestamp":1637366400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1007\/s10479-021-04351-2","type":"journal-article","created":{"date-parts":[[2021,11,20]],"date-time":"2021-11-20T12:02:42Z","timestamp":1637409762000},"page":"587-610","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An optimal data-splitting algorithm for aircraft sequencing on a single runway"],"prefix":"10.1007","volume":"309","author":[{"given":"Rakesh","family":"Prakash","sequence":"first","affiliation":[]},{"given":"Jitamitra","family":"Desai","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4660-8866","authenticated-orcid":false,"given":"Rajesh","family":"Piplani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,20]]},"reference":[{"key":"4351_CR1","unstructured":"Abela, J., Abramson, D., Krishnamoorthy, M., De\u00a0Silva, A., & Mills, G. (1993). Computing optimal schedules for landing aircraft. In Proceedings of the 12th National ASOR Conference. Adelaide, Australia."},{"issue":"6","key":"4351_CR2","doi-asserted-by":"publisher","first-page":"988","DOI":"10.2514\/2.2882","volume":"38","author":"I Anagnostakis","year":"2001","unstructured":"Anagnostakis, I., Clarke, J.-P., B\u00f6hme, D., & V\u00f6lcker, U. (2001). Runway operations planning and control: Sequencing and scheduling. Journal of Aircraft, 38(6), 988\u2013996.","journal-title":"Journal of Aircraft"},{"issue":"1","key":"4351_CR3","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10479-019-03138-w","volume":"285","author":"J-P Arnaout","year":"2020","unstructured":"Arnaout, J.-P. (2020). A worm optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times. Annals of Operations Research, 285(1), 273\u2013293.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"4351_CR4","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/PL00011432","volume":"90","author":"N Ascheuer","year":"2001","unstructured":"Ascheuer, N., Fischetti, M., & Gr\u00f6tschel, M. (2001). Solving the asymmetric travelling salesman problem with time windows by branch-and-cut. Mathematical Programming, 90(3), 475\u2013506.","journal-title":"Mathematical Programming"},{"key":"4351_CR5","doi-asserted-by":"crossref","unstructured":"Balakrishnan, H. & Chandran, B. (2006). Scheduling aircraft landings under constrained position shifting. In AIAA guidance, navigation, and control conference and exhibit, p. 6320.","DOI":"10.2514\/6.2006-6320"},{"issue":"6","key":"4351_CR6","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\u20131665.","journal-title":"Operations Research"},{"key":"4351_CR7","unstructured":"Ball, M., Barnhart, C., Dresner, M., Hansen, M., Neels, K., Odoni, A., Peterson, E., Sherry, L., Trani, A., Zou, B., et al. (2010). Total delay impact study. NEXTOR: Technical report."},{"issue":"2","key":"4351_CR8","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\u2014the static case. Transportation Science, 34(2), 180\u2013197.","journal-title":"Transportation Science"},{"issue":"1","key":"4351_CR9","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\u2013270.","journal-title":"Annals of Operations Research"},{"key":"4351_CR10","doi-asserted-by":"crossref","unstructured":"Bianco, L., Dell\u2019Olmo, P., & Giordani, S. (1999). Minimizing total completion time subject to release dates and sequence-dependent processing times. Annals of Operations Research, 86, 393\u2013415.","DOI":"10.1023\/A:1018975323093"},{"key":"4351_CR11","doi-asserted-by":"crossref","unstructured":"Bianco, L., Dell\u2019Olmo, P., & Giordani, S. (2006). Scheduling models for air traffic control in terminal areas. Journal of Scheduling, 9(3), 223\u2013253.","DOI":"10.1007\/s10951-006-6779-7"},{"issue":"1","key":"4351_CR12","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10951-013-0337-x","volume":"17","author":"D Briskorn","year":"2014","unstructured":"Briskorn, D., & Stolletz, R. (2014). Aircraft landing problems with aircraft classes. Journal of Scheduling, 17(1), 31\u201345.","journal-title":"Journal of Scheduling"},{"issue":"4","key":"4351_CR13","doi-asserted-by":"publisher","first-page":"898","DOI":"10.1287\/trsc.2016.0733","volume":"52","author":"G De Maere","year":"2017","unstructured":"De Maere, G., Atkin, J. A., & Burke, E. K. (2017). Pruning rules for optimal runway sequencing. Transportation Science, 52(4), 898\u2013916.","journal-title":"Transportation Science"},{"key":"4351_CR14","unstructured":"Dear, R. G. (1976). The dynamic scheduling of aircraft in the near terminal area. Flight Transportation Laboratory, Massachusetts Institute of Technology, Cambridge, MA: Technical report."},{"key":"4351_CR15","unstructured":"Desai, J. & Prakash, R. (2016a). Flight sequencing and scheduling: A data-driven approach. In Proceedings of the Industrial and Systems Engineering Research Conference. Institute of Industrial Engineers, Anaheim, CA."},{"key":"4351_CR16","doi-asserted-by":"crossref","unstructured":"Desai, J. & Prakash, R. (2016b). An optimization framework for terminal sequencing and scheduling: The single runway case. In Proceedings of the Complex Systems Design & Management 2016 Asia Conference, pp. 195\u2013207. Springer, Cham.","DOI":"10.1007\/978-3-319-29643-2_15"},{"key":"4351_CR17","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-319-09174-7_23","volume-title":"Combinatorial optimization: Third international symposium","author":"F Furini","year":"2014","unstructured":"Furini, F., Kidd, M. P., Persiani, C. A., & Toth, P. (2014). State space reduced dynamic programming for the aircraft sequencing problem with constrained position shifting. Combinatorial optimization: Third international symposium (pp. 267\u2013279). Cham: Springer."},{"issue":"5","key":"4351_CR18","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s10951-014-0415-8","volume":"18","author":"F Furini","year":"2015","unstructured":"Furini, F., Kidd, M. P., Persiani, C. A., & Toth, P. (2015). Improved rolling horizon approaches to the aircraft sequencing problem. Journal of Scheduling, 18(5), 435\u2013447.","journal-title":"Journal of Scheduling"},{"key":"4351_CR19","doi-asserted-by":"crossref","unstructured":"Garcia, J.-L. (1990). Maestro- a metering and spacing tool. In Proceedings of the American Control Conference, pp. 502\u2013507. San Diego, CA.","DOI":"10.23919\/ACC.1990.4790786"},{"issue":"3","key":"4351_CR20","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1287\/ijoc.2013.0581","volume":"26","author":"A Ghoniem","year":"2014","unstructured":"Ghoniem, A., Sherali, H. D., & Baik, H. (2014). Enhanced models for a mixed arrival-departure aircraft sequencing problem. INFORMS Journal on Computing, 26(3), 514\u2013530.","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"4351_CR21","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1109\/TITS.2005.848365","volume":"6","author":"X-B Hu","year":"2005","unstructured":"Hu, X.-B., & Chen, W.-H. (2005). Receding horizon control for aircraft arrival sequencing and scheduling. IEEE Transactions on Intelligent Transportation Systems, 6(2), 189\u2013197.","journal-title":"IEEE Transactions on Intelligent Transportation Systems"},{"issue":"5","key":"4351_CR22","first-page":"429","volume":"40","author":"O Krafft","year":"2002","unstructured":"Krafft, O., & Schaefer, M. (2002). On the number of permutations within a given distance. Fibonacci Quarterly, 40(5), 429\u2013434.","journal-title":"Fibonacci Quarterly"},{"issue":"12","key":"4351_CR23","doi-asserted-by":"publisher","first-page":"2081","DOI":"10.1109\/JPROC.2008.2006145","volume":"96","author":"H Lee","year":"2008","unstructured":"Lee, H., & Balakrishnan, H. (2008). A study of tradeoffs in scheduling terminal-area operations. Proceedings of the IEEE, 96(12), 2081\u20132095.","journal-title":"Proceedings of the IEEE"},{"issue":"1","key":"4351_CR24","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\u201369.","journal-title":"European Journal of Operational Research"},{"key":"4351_CR25","volume-title":"Analysis of delay reducing and fuel saving sequencing and spacing algorithms for arrival traffic","author":"F Neuman","year":"1991","unstructured":"Neuman, F., & Erzberger, H. (1991). Analysis of delay reducing and fuel saving sequencing and spacing algorithms for arrival traffic. Moffett Field, CA: NASA Ames Research Center."},{"issue":"1\u20132","key":"4351_CR26","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10479-017-2481-8","volume":"272","author":"J Pei","year":"2019","unstructured":"Pei, J., Cheng, B., Liu, X., Pardalos, P. M., & Kong, M. (2019). Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time. Annals of Operations Research, 272(1\u20132), 217\u2013241.","journal-title":"Annals of Operations Research"},{"key":"4351_CR27","unstructured":"Prakash, R. & Desai, J. (2017). A data-splitting algorithm for flight sequencing and scheduling on two runways. In Proceedings of the Industrial and Systems Engineering Research Conference. Institute of Industrial Engineers, Pittsburgh, USA."},{"key":"4351_CR28","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1016\/j.trc.2018.07.031","volume":"95","author":"R Prakash","year":"2018","unstructured":"Prakash, R., Piplani, R., & Desai, J. (2018). An optimal data-splitting algorithm for aircraft scheduling on a single runway to maximize throughput. Transportation Research Part C: Emerging Technologies, 95, 570\u2013581.","journal-title":"Transportation Research Part C: Emerging Technologies"},{"key":"4351_CR29","unstructured":"Psaraftis, H.\u00a0N. (1978). A dynamic programming approach to the aircraft sequencing problem. PhD thesis, Massachusetts Institute of Technology, Cambridge."},{"issue":"6","key":"4351_CR30","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\u20131359.","journal-title":"Operations Research"},{"issue":"1","key":"4351_CR31","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 efficient hybrid meta-heuristic for aircraft landing problem. Computers & Operations Research, 40(1), 207\u2013213.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"4351_CR32","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"HD Sherali","year":"1990","unstructured":"Sherali, H. D., & Adams, W. P. (1990). A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM Journal on Discrete Mathematics, 3(3), 411\u2013430.","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"4351_CR33","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0166-218X(92)00190-W","volume":"52","author":"HD Sherali","year":"1994","unstructured":"Sherali, H. D., & Adams, W. P. (1994). A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems. Discrete Applied Mathematics, 52(1), 83\u2013106.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"4351_CR34","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. J. (2008). Scheduling aircraft landings using airlines preferences. European Journal of Operational Research, 190(1), 277\u2013291.","journal-title":"European Journal of Operational Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-04351-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-021-04351-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-04351-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,20]],"date-time":"2022-01-20T19:31:37Z","timestamp":1642707097000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-021-04351-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,20]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["4351"],"URL":"https:\/\/doi.org\/10.1007\/s10479-021-04351-2","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2021,11,20]]},"assertion":[{"value":"29 September 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}