{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T18:28:04Z","timestamp":1770748084382,"version":"3.49.0"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T00:00:00Z","timestamp":1649030400000},"content-version":"vor","delay-in-days":3,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100006389","name":"University of Geneva","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100006389","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2022,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p><jats:italic>Aircraft Landing Planning<\/jats:italic> is challenging because the inherently limited capacity of airport runways causes bottlenecks. This type of planning involves different stakeholders (e.g., airlines, air traffic services providers, airport authorities, and passengers) and faces various uncertainties (e.g., take-off time variability, or wind speeds). This study, conducted in collaboration with the European Organization for the Safety of Air Navigation (EUROCONTROL), proposes a mathematical formulation of the problem and a simulation framework that accounts for uncertainties. We also propose different solution methods: a descent and a tabu search, as well as a mechanism for guiding restarts, to diversify the search process. These methods provide, in our simulated environment, more effective and stable solutions than the popular first-come-first-served practice regarding three objective functions (namely, delay, fuel, and landing sequence stability), which are considered lexicographically. Indeed, the average delays and fuel costs are reduced by 50% and 10%, respectively, at the cost of a small number of landing-sequence modifications, as each flight is repositioned an average of 0.5 times. Moreover, the computations can be performed quickly, which is crucial because re-optimization needs to be done online when flight information is updated.<\/jats:p>","DOI":"10.1007\/s10951-022-00730-0","type":"journal-article","created":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T04:02:33Z","timestamp":1649044953000},"page":"203-228","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Aircraft landing planning under uncertain conditions"],"prefix":"10.1007","volume":"25","author":[{"given":"Marie-Sklaerder","family":"Vi\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Zufferey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roel","family":"Leus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,4]]},"reference":[{"issue":"4","key":"730_CR1","doi-asserted-by":"publisher","first-page":"3846","DOI":"10.1016\/j.asoc.2011.02.022","volume":"11","author":"J Aghaei","year":"2011","unstructured":"Aghaei, J., Amjady, N., & Shayanfar, H. (2011). Multi-objective electricity market clearing considering dynamic security by lexicographic optimization and augmented epsilon constraint method. Applied Soft Computing, 11(4), 3846\u20133858.","journal-title":"Applied Soft Computing"},{"issue":"3","key":"730_CR2","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1016\/j.ejor.2006.06.076","volume":"189","author":"K Artiouchine","year":"2008","unstructured":"Artiouchine, K., Baptiste, P., & D\u00fcrr, C. (2008). Runway sequencing with holding patterns. European Journal of Operational Research, 189(3), 1254\u20131266.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"730_CR3","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"},{"issue":"5","key":"730_CR4","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\u2013493.","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"730_CR5","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10288-011-0172-x","volume":"9","author":"JA Bennell","year":"2011","unstructured":"Bennell, J. A., Mesgarpour, M., & Potts, C. N. (2011). Airport runway scheduling. 4OR: A Quarterly Journal of Operations Research, 9(2), 115\u2013138.","journal-title":"4OR: A Quarterly Journal of Operations Research"},{"issue":"1","key":"730_CR6","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\u2013327.","journal-title":"European Journal of Operational Research"},{"issue":"7","key":"730_CR7","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1057\/palgrave.jors.2602636","volume":"60","author":"AR Brentnall","year":"2009","unstructured":"Brentnall, A. R., & Cheng, R. C. H. (2009). Some effects of aircraft arrival sequence algorithms. Journal of the Operational Research Society, 60(7), 962\u2013972.","journal-title":"Journal of the Operational Research Society"},{"issue":"5","key":"730_CR8","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.jairtraman.2004.05.004","volume":"10","author":"S Capr\u00ec","year":"2004","unstructured":"Capr\u00ec, S., & Ignaccolo, M. (2004). Genetic algorithms for solving the aircraft-sequencing problem: the introduction of departures into the dynamic model. Journal of Air Transport Management, 10(5), 345\u2013351.","journal-title":"Journal of Air Transport Management"},{"issue":"11","key":"730_CR9","doi-asserted-by":"publisher","first-page":"3491","DOI":"10.1016\/j.cor.2006.02.022","volume":"34","author":"CC Chern","year":"2007","unstructured":"Chern, C. C., & Hsieh, J. S. (2007). A heuristic algorithm for master planning that satisfies multiple objectives. Computers and Operations Research, 34(11), 3491\u20133513.","journal-title":"Computers and Operations Research"},{"issue":"5","key":"730_CR10","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1016\/0026-2714(89)90171-6","volume":"29","author":"RG Dear","year":"1989","unstructured":"Dear, R. G., & Sherif, Y. S. (1989). The dynamic scheduling of aircraft in high density terminal areas. Microelectronics Reliability, 29(5), 743\u2013749.","journal-title":"Microelectronics Reliability"},{"issue":"2\/3","key":"730_CR11","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0191-2607(91)90132-A","volume":"25","author":"RG Dear","year":"1991","unstructured":"Dear, R. G., & Sherif, Y. S. (1991). An algorithm for computer assisted sequencing and scheduling of terminal area operations. Transportation Research Part A, 25(2\/3), 129\u2013139.","journal-title":"Transportation Research Part A"},{"issue":"1","key":"730_CR12","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s00291-016-0443-1","volume":"39","author":"U Dorndorf","year":"2016","unstructured":"Dorndorf, U., Jaehn, F., & Pesch, E. (2016). Flight gate assignment and recovery strategies with stochastic arrival and departure times. OR Spectrum, 39(1), 65\u201393.","journal-title":"OR Spectrum"},{"issue":"3","key":"730_CR13","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1287\/moor.15.3.483","volume":"15","author":"J Du","year":"1990","unstructured":"Du, J., & Leung, J. Y. T. (1990). Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research, 15(3), 483\u2013495.","journal-title":"Mathematics of Operations Research"},{"key":"730_CR14","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1023\/B:ANOR.0000032575.38969.ab","volume":"130","author":"A Dupont","year":"2004","unstructured":"Dupont, A., Alvernhe, E., & Vasquez, M. (2004). Efficient filtering and Tabu search on a consistent neighbourhoodfor the frequency assignment problem with polarisation. Annals of Operations Research, 130, 179\u2013198.","journal-title":"Annals of Operations Research"},{"key":"730_CR15","unstructured":"Erzberger, H. (1995). Design principles and algorithms for automated air traffic management. AGARD Lecture Series No 200: Knowledge-Based Functions in Aerospace Systems, Madrid, Paris, and San Francisco 7(2)"},{"issue":"3","key":"730_CR16","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\u20131038.","journal-title":"European Journal of Operational Research"},{"key":"730_CR17","unstructured":"Gallay, O., & Zufferey, N. (2018). Metaheuristics for lexicographic optimization in industry. In: Proceedings of the 19th EU\/ME Workshop on Metaheuristics for Industry, EU\/ME 2018, Geneva, Switzerland, March 22\u201323"},{"key":"730_CR18","volume-title":"Handbook of Metaheuristics, International Series in Operations Research and Management Science","author":"M Gendreau","year":"2019","unstructured":"Gendreau, M., & Potvin, J. Y. (2019). Handbook of Metaheuristics, International Series in Operations Research and Management Science (Vol. 146). New York: Springer."},{"issue":"2\u20133","key":"730_CR19","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0377-2217(97)00259-2","volume":"106","author":"F Glover","year":"1998","unstructured":"Glover, F. (1998). Tabu search: wellsprings and challenges. European Journal of Operational Research, 106(2\u20133), 221\u2013225.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"730_CR20","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen, P., & Mladenovi\u0107, N. (2001). Variable neighborhood search: Principles and applications. European Journal of Operational Research, 130(3), 449\u2013467.","journal-title":"European Journal of Operational Research"},{"key":"730_CR21","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.jairtraman.2016.02.009","volume":"56","author":"A Heidt","year":"2016","unstructured":"Heidt, A., Helmke, H., Kapolke, M., Liers, F., & Martin, A. (2016). Robust runway scheduling under uncertain conditions. Journal of Air Transport Management, 56, 28\u201337.","journal-title":"Journal of Air Transport Management"},{"issue":"6","key":"730_CR22","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1145\/360825.360861","volume":"18","author":"DS Hirschberg","year":"1975","unstructured":"Hirschberg, D. S. (1975). A linear space algorithm for computing maximal common subsequences. Communications of the ACM, 18(6), 341\u2013343.","journal-title":"Communications of the ACM"},{"issue":"5","key":"730_CR23","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1016\/j.engappai.2004.11.012","volume":"18","author":"XB Hu","year":"2005","unstructured":"Hu, X. B., & Chen, W. H. (2005). Genetic algorithm based on receding horizon control for arrival sequencing and scheduling. Engineering Applications of Artificial Intelligence, 18(5), 633\u2013642.","journal-title":"Engineering Applications of Artificial Intelligence"},{"issue":"1","key":"730_CR24","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.cor.2007.09.005","volume":"36","author":"XB Hu","year":"2009","unstructured":"Hu, X. B., & Di Paolo, E. (2009). An efficient genetic algorithm with uniform crossover for air traffic control. Computers and Operations Research, 36(1), 245\u2013259.","journal-title":"Computers and Operations Research"},{"key":"730_CR25","doi-asserted-by":"crossref","unstructured":"Khassiba, A., Bastin, F., Gendron, B., Cafieri, S., & Mongeau, M. (2019). Extended aircraft arrival management under uncertainty: A computational study. Journal of Air Transportation pp 1\u201313","DOI":"10.2514\/1.D0135"},{"issue":"4","key":"730_CR26","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1287\/trsc.2020.0991","volume":"54","author":"A Khassiba","year":"2020","unstructured":"Khassiba, A., Bastin, F., Cafieri, S., Gendron, B., & Mongeau, M. (2020). Two-stage stochastic mixed-integer programming with chance constraints for extended aircraft arrival management. Transportation Science, 54(4), 897\u2013919.","journal-title":"Transportation Science"},{"issue":"1","key":"730_CR27","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1057\/jors.2009.76","volume":"61","author":"G Laporte","year":"2010","unstructured":"Laporte, G. (2010). A concise guide to the traveling salesman problem. Journal of the Operational Research Society, 61(1), 35\u201340.","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"730_CR28","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.ejor.2019.09.010","volume":"282","author":"F Lehu\u00e9d\u00e9","year":"2020","unstructured":"Lehu\u00e9d\u00e9, F., P\u00e9ton, O., & Tricoire, F. (2020). A lexicographic minimax approach to the vehicle routing problem with route balancing. European Journal of Operational Research, 282(1), 129\u2013147.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"730_CR29","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":"730_CR30","doi-asserted-by":"crossref","unstructured":"Liu, M., Liang, B., Zheng, F., Chu, C., & Chu, F. (2018). A two-stage stochastic programming approach for aircraft landing problem. In: Proceedings of the 15th International Conference on Service Systems and Service Management, Hang Zhou, China","DOI":"10.1109\/ICSSSM.2018.8465107"},{"issue":"1","key":"730_CR31","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G Navarro","year":"2001","unstructured":"Navarro, G. (2001). A guided tour to approximate string matching. ACM Computing Surveys, 33(1), 31\u201388.","journal-title":"ACM Computing Surveys"},{"issue":"4","key":"730_CR32","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1287\/trsc.1120.0411","volume":"46","author":"T Nikoleris","year":"2012","unstructured":"Nikoleris, T., & Hansen, M. (2012). Queueing models for trajectory-based aircraft operations. Transportation Science, 46(4), 501\u2013511.","journal-title":"Transportation Science"},{"issue":"7","key":"730_CR33","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1016\/j.compind.2007.05.009","volume":"58","author":"A Pfeiffer","year":"2007","unstructured":"Pfeiffer, A., K\u00e1d\u00e1r, B., & Monostori, L. (2007). Stability-oriented evaluation of rescheduling strategies, by using simulation. Computers in Industry, 58(7), 630\u2013643.","journal-title":"Computers in Industry"},{"key":"730_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26580-3","volume-title":"Scheduling: Theory, algorithms, and systems","author":"ML Pinedo","year":"2016","unstructured":"Pinedo, M. L. (2016). Scheduling: Theory, algorithms, and systems. New York: Springer."},{"issue":"2","key":"730_CR35","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. E. (2006). Scatter search and bionomic algorithms for the aircraft landing problem. European Journal of Operational Research, 171(2), 439\u2013462.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"730_CR36","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.ast.2009.11.003","volume":"14","author":"X Prats","year":"2010","unstructured":"Prats, X., Puig, V., Quevedo, J., & Nejjari, F. (2010). Lexicographic optimisation for optimal departure aircraft trajectories. Aerospace Science and Technology, 14(1), 26\u201337.","journal-title":"Aerospace Science and Technology"},{"issue":"3","key":"730_CR37","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1002\/net.21656","volume":"67","author":"J Respen","year":"2016","unstructured":"Respen, J., Zufferey, N., & Amaldi, E. (2016). Metaheuristics for a job scheduling problem with smoothing costs relevant for the car industry. Networks, 67(3), 246\u2013261.","journal-title":"Networks"},{"issue":"10","key":"730_CR38","doi-asserted-by":"publisher","first-page":"1195","DOI":"10.1057\/s41274-016-0136-9","volume":"68","author":"J Respen","year":"2017","unstructured":"Respen, J., Zufferey, N., & Wieser, P. (2017). Three-level inventory deployment for a luxury watch company facing various perturbations. Journal of the Operational Research Society, 68(10), 1195\u20131210.","journal-title":"Journal of the Operational Research Society"},{"key":"730_CR39","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.omega.2015.03.007","volume":"56","author":"NR Sabar","year":"2015","unstructured":"Sabar, N. R., & Kendall, G. (2015). An iterated local search with multiple perturbation operators and time varying perturbation strength for the aircraft landing problem. Omega, 56, 88\u201398.","journal-title":"Omega"},{"key":"730_CR40","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.jet.2017.04.003","volume":"170","author":"J Schummer","year":"2017","unstructured":"Schummer, J., & Abizada, A. (2017). Incentives in landing slot problems. Journal of Economic Theory, 170, 29\u201355.","journal-title":"Journal of Economic Theory"},{"issue":"2","key":"730_CR41","first-page":"164","volume":"5","author":"J Schummer","year":"2013","unstructured":"Schummer, J., & Vohra, R. V. (2013). Assignment of arrival slots. American Economic Journal: Microeconomics, 5(2), 164\u201385.","journal-title":"American Economic Journal: Microeconomics"},{"key":"730_CR42","unstructured":"Shone, R., Glazebrook, K.D., & Zografos, K. (2018). Stochastic modelling of aircraft queues: A review. In: Proceedings of the OR60 Annual Conference, Lancaster"},{"key":"730_CR43","unstructured":"SKYbrary (2017) RECAT: Wake Turbulence Re-categorisation. https:\/\/www.skybrary.aero\/index.php\/RECAT_-_Wake_Turbulence_Re-categorisation"},{"key":"730_CR44","unstructured":"SKYbrary. (2019). Parallel Runway Operation. https:\/\/www.skybrary.aero\/index.php\/Parallel_Runway_Operation"},{"issue":"3","key":"730_CR45","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1016\/j.ejor.2007.04.033","volume":"191","author":"C Solnon","year":"2008","unstructured":"Solnon, C., Cung, V. D., Nguyen, A., & Artigues, C. (2008). The car sequencing problem: Overview of state-of-the-art methods and industrial case-study of the ROADEF 2005 challenge problem. Europeran Journal of Operational Research, 191(3), 912\u2013927.","journal-title":"Europeran Journal of Operational Research"},{"issue":"1","key":"730_CR46","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.ejor.2007.06.017","volume":"190","author":"MJ Soomer","year":"2008","unstructured":"Soomer, M. J., & 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"},{"issue":"4\u20135","key":"730_CR47","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"E Taillard","year":"1991","unstructured":"Taillard, E. (1991). Robust taboo search for the quadratic assignment problem. Parallel Computing, 17(4\u20135), 443\u2013455.","journal-title":"Parallel Computing"},{"key":"730_CR48","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.dam.2016.05.023","volume":"234","author":"S Thevenin","year":"2018","unstructured":"Thevenin, S., Zufferey, N., & Potvin, J. Y. (2018). Graph multi-coloring for a job scheduling application. Discrete Applied Mathematics, 234, 218\u2013235.","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"730_CR49","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1017\/S0373463397007625","volume":"51","author":"DA Trivizas","year":"1998","unstructured":"Trivizas, D. A. (1998). Optimal scheduling with maximum position shift (MPS) constraints: A runway scheduling application. Journal of Navigation, 51(2), 250\u2013266.","journal-title":"Journal of Navigation"},{"key":"730_CR50","unstructured":"Vanwelsenaere, A., Ellerbroek, J., & Hoekstra, J.M. (2017). Analysis on the impact of pop-up flight occurrence when extending the arrival management horizon. In: Proceedings of the 12th USA\/Europe Air Traffic Management Rechearch and Development Seminar, Seattle"},{"key":"730_CR51","unstructured":"Vi\u00e9, M.S., & Zufferey, N. (2021). Real instances for aircraft landing planning. https:\/\/data.mendeley.com\/datasets\/rcdvm6y7sm\/2"},{"key":"730_CR52","unstructured":"Vi\u00e9, M.S., Zufferey, N., & Leus, R. (2018). Aircraft landing planning: Past, present and future. In: Proceedings of the 19th ROADEF Conference, ROADEF 2018, Lorient, France, February 21\u201323"},{"issue":"4","key":"730_CR53","doi-asserted-by":"publisher","first-page":"3485","DOI":"10.1016\/j.asoc.2011.01.022","volume":"11","author":"SP Yu","year":"2011","unstructured":"Yu, S. P., Cao, X. B., & Zhang, J. (2011). A real-time schedule method for aircraft landing scheduling problem based on cellular automation. Applied Soft Computing, 11(4), 3485\u20133493.","journal-title":"Applied Soft Computing"},{"issue":"6","key":"730_CR54","first-page":"446","volume":"3","author":"N Zufferey","year":"2012","unstructured":"Zufferey, N. (2012). Metaheuristics: some principles for an efficient design. Computer Technology and Application, 3(6), 446\u2013462.","journal-title":"Computer Technology and Application"},{"key":"730_CR55","doi-asserted-by":"crossref","unstructured":"Zulkifli, A., Aziz, N.A.A., Aziz, N.H.A., Ibrahim, Z., & Mokhtar, N. (2018). Review on computational techniques in solving aircraft landing problem. In: Proceedings of the 2018 International Conference on Artificial Life and Robotics, Oita, Japan","DOI":"10.5954\/ICAROB.2018.GS5-3"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-022-00730-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-022-00730-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-022-00730-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,22]],"date-time":"2022-04-22T07:25:51Z","timestamp":1650612351000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-022-00730-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4]]},"references-count":55,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["730"],"URL":"https:\/\/doi.org\/10.1007\/s10951-022-00730-0","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4]]},"assertion":[{"value":"25 February 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"The authors declare that they have no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}