{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T21:12:16Z","timestamp":1773436336394,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,4,22]],"date-time":"2016-04-22T00:00:00Z","timestamp":1461283200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft (DE)","doi-asserted-by":"publisher","award":["PE 514\/10-1"],"award-info":[{"award-number":["PE 514\/10-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s00291-016-0443-1","type":"journal-article","created":{"date-parts":[[2016,4,22]],"date-time":"2016-04-22T04:58:34Z","timestamp":1461301114000},"page":"65-93","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":50,"title":["Flight gate assignment and recovery strategies with stochastic arrival and departure times"],"prefix":"10.1007","volume":"39","author":[{"given":"Ulrich","family":"Dorndorf","sequence":"first","affiliation":[]},{"given":"Florian","family":"Jaehn","sequence":"additional","affiliation":[]},{"given":"Erwin","family":"Pesch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"key":"443_CR1","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0377-2217(98)00375-0","volume":"120","author":"A Bolat","year":"2000","unstructured":"Bolat A (2000) Procedures for providing robust gate assignments for arriving aircraft. Eur J Oper Res 120:63\u201380","journal-title":"Eur J Oper Res"},{"key":"443_CR2","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/j.cor.2014.02.011","volume":"65","author":"J Castaing","year":"2016","unstructured":"Castaing J, Mukherjee I, Cohn A, Hurwitz L, Nguyen A, M\u00fcller JJ (2016) Reducing airport gate blockage in passenger aviation: models and analysis. Comput Oper Res 65:189\u2013199","journal-title":"Comput Oper Res"},{"issue":"6","key":"443_CR3","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1007\/s10951-012-0292-y","volume":"15","author":"G Diepen","year":"2012","unstructured":"Diepen G, Akker J, Hoogeveen J, Smeltink J (2012) Finding a robust assignment of flights to gates at Amsterdam Airport Schiphol. J Sched 15(6):703\u2013715","journal-title":"J Sched"},{"key":"443_CR4","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1057\/palgrave.jors.2601736","volume":"55","author":"H Ding","year":"2004","unstructured":"Ding H, Lim A, Rodrigues B, Zhu Y (2004) New heuristics for the overconstrained airport gate assignment problem. J Oper Res Soc 55:760\u2013768","journal-title":"J Oper Res Soc"},{"key":"443_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-57506-8","volume-title":"Project scheduling with time windows: from theory to application","author":"U Dorndorf","year":"2002","unstructured":"Dorndorf U (2002) Project scheduling with time windows: from theory to application. Physica, Heidelberg"},{"key":"443_CR6","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1287\/ijoc.6.2.141","volume":"6","author":"U Dorndorf","year":"1994","unstructured":"Dorndorf U, Pesch E (1994) Fast clustering algorithms. ORSA J Comput 6:141\u2013153","journal-title":"ORSA J Comput"},{"key":"443_CR7","doi-asserted-by":"crossref","first-page":"1365","DOI":"10.1287\/mnsc.46.10.1365.12272","volume":"46","author":"U Dorndorf","year":"2000","unstructured":"Dorndorf U, Pesch E, Phan-Huy T (2000) A time-oriented branch-and-bound algorithm for resource constrained project scheduling with generalised precedence constraints. Manag Sci 46:1365\u20131384","journal-title":"Manag Sci"},{"key":"443_CR8","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1016\/j.omega.2005.07.001","volume":"35","author":"U Dorndorf","year":"2007","unstructured":"Dorndorf U, Drexl A, Nikulin Y, Pesch E (2007) Flight gate scheduling: state-of-the-art and recent developments. Omega 35:326\u2013334","journal-title":"Omega"},{"key":"443_CR9","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1287\/trsc.1070.0211","volume":"42","author":"U Dorndorf","year":"2008","unstructured":"Dorndorf U, Jaehn F, Pesch E (2008) Modelling robust flight gate scheduling as a clique partitioning problem. Transp Sci 42:292\u2013301","journal-title":"Transp Sci"},{"key":"443_CR10","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s10479-010-0809-8","volume":"194","author":"U Dorndorf","year":"2012","unstructured":"Dorndorf U, Jaehn F, Pesch E (2012) Flight gate scheduling with respect to a reference schedule. Ann Oper Res 194:177\u2013187","journal-title":"Ann Oper Res"},{"key":"443_CR11","unstructured":"Drexl A, Nikulin Y (2006) Fuzzy multicriteria flight gate assignment. Working paper no. 605, University of Kiel"},{"key":"443_CR12","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/BF01589097","volume":"45","author":"M Gr\u00f6tschel","year":"1989","unstructured":"Gr\u00f6tschel M, Wakabayashi Y (1989) A cutting plane algorithm for a clustering problem. Math Program B 45:52\u201396","journal-title":"Math Program B"},{"key":"443_CR13","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF01580870","volume":"47","author":"M Gr\u00f6tschel","year":"1990","unstructured":"Gr\u00f6tschel M, Wakabayashi Y (1990) Facets of the clique partitioning polytope. Math Program A 47:367\u2013387","journal-title":"Math Program A"},{"issue":"2","key":"443_CR14","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/j.ejor.2015.04.040","volume":"246","author":"J Gu\u00e9pet","year":"2015","unstructured":"Gu\u00e9pet J, Acuna-Agost R, Briant O, Gayon J-P (2015) Exact and heuristic approaches to the airport stand allocation problem. Eur J Oper Res 246(2):597\u2013608","journal-title":"Eur J Oper Res"},{"key":"443_CR15","first-page":"26","volume":"1423","author":"M Hassounah","year":"1993","unstructured":"Hassounah M, Steuart G (1993) Demand for aircraft gates. Transp Res Rec 1423:26\u201333","journal-title":"Transp Res Rec"},{"issue":"13","key":"443_CR16","doi-asserted-by":"crossref","first-page":"2025","DOI":"10.1016\/j.dam.2013.02.011","volume":"161","author":"F Jaehn","year":"2013","unstructured":"Jaehn F, Pesch E (2013) New bounds and constraint propagation techniques for the clique partitioning problem. Discrete Appl Math 161(13):2025\u20132037","journal-title":"Discrete Appl Math"},{"issue":"2","key":"443_CR17","doi-asserted-by":"crossref","first-page":"467","DOI":"10.2514\/1.57022","volume":"36","author":"SH Kim","year":"2013","unstructured":"Kim SH, Feron E, Clarke J-P (2013) Gate assignment to minimize passenger transit time and aircraft taxi time. J Guid Control Dyn 36(2):467\u2013475","journal-title":"J Guid Control Dyn"},{"issue":"7","key":"443_CR18","doi-asserted-by":"crossref","first-page":"902","DOI":"10.1002\/atr.1235","volume":"48","author":"V Kumar","year":"2014","unstructured":"Kumar V, Bierlaire M (2014) Multi-objective airport gate assignment problem in planning and operations. J Adv Transp 48(7):902\u2013926","journal-title":"J Adv Transp"},{"key":"443_CR19","doi-asserted-by":"crossref","unstructured":"Lim A, Wang F (2005) Robust airport gate assignment. In: ICTAI \u201905: proceedings of the 17th IEEE international conference on tools with artificial intelligence, Washington, DC, USA. IEEE Computer Society, pp 74\u201381","DOI":"10.1109\/ICTAI.2005.110"},{"issue":"3","key":"443_CR20","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S1366-5545(02)00026-1","volume":"39","author":"GF List","year":"2003","unstructured":"List GF, Wood B, Nozick LK, Turnquist MA, Jones DA, Kjeldgaard EA, Lawton CR (2003) Robust optimization for fleet planning under uncertainty. Transp Res Part E: Logist Transp Rev 39(3):209\u2013227","journal-title":"Transp Res Part E: Logist Transp Rev"},{"issue":"2","key":"443_CR21","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1287\/opre.43.2.264","volume":"43","author":"JM Mulvey","year":"1995","unstructured":"Mulvey JM, Vanderbei RJ, Zenios SA (1995) Robust optimization of large-scale systems. Oper Res 43(2):264\u2013281","journal-title":"Oper Res"},{"key":"443_CR22","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/978-3-642-41019-2_14","volume":"8197","author":"UM Neuman","year":"2013","unstructured":"Neuman UM, Atkin JA (2013) Airport gate assignment considering ground movement. Lect Notes Comput Sci 8197:184\u2013198","journal-title":"Lect Notes Comput Sci"},{"key":"443_CR23","unstructured":"Nikulin Y (2006) Robustness in combinatorial optimization and scheduling theory: an extended annotated bibliography. Working paper no. 606, University of Kiel"},{"issue":"3","key":"443_CR24","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s10951-009-0112-1","volume":"13","author":"Y Nikulin","year":"2010","unstructured":"Nikulin Y, Drexl A (2010) Theoretical aspects of multicriteria flight gate scheduling: deterministic and fuzzy models. J Sched 13(3):261\u2013280","journal-title":"J Sched"},{"issue":"5","key":"443_CR25","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/s10951-013-0323-3","volume":"17","author":"S Ravizza","year":"2014","unstructured":"Ravizza S, Atkin J, Burke E (2014) A more realistic approach for airport ground movement optimisation with stand holding. J Sched 17(5):507\u2013520","journal-title":"J Sched"},{"key":"443_CR26","unstructured":"Richter U (2005) Analyse und Simulation von FlugverspStungen zur robusten Schichtplanung von Abfertigungsdiensten auf FlughSfen. Master\u2019s thesis, Department of Mathematics, RWTH Aachen University"},{"issue":"2","key":"443_CR27","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1016\/j.tre.2011.10.008","volume":"48","author":"M \u015eeker","year":"2012","unstructured":"\u015eeker M, Noyan N (2012) Stochastic optimization models for the airport gate assignment problem. Transp Res Part E: Logist Transp Rev 48(2):438\u2013459","journal-title":"Transp Res Part E: Logist Transp Rev"},{"key":"443_CR28","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1016\/j.ejor.2006.05.002","volume":"180","author":"S Yan","year":"2007","unstructured":"Yan S, Tang C (2007) A heuristic approach for airport gate assignments for stochastic flight delays. Eur J Oper Res 180:547\u2013567","journal-title":"Eur J Oper Res"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-016-0443-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00291-016-0443-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-016-0443-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-016-0443-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T07:00:07Z","timestamp":1559026807000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-016-0443-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,22]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["443"],"URL":"https:\/\/doi.org\/10.1007\/s00291-016-0443-1","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4,22]]}}}