{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T07:41:59Z","timestamp":1774597319538,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2012,10,18]],"date-time":"2012-10-18T00:00:00Z","timestamp":1350518400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s10951-012-0292-y","type":"journal-article","created":{"date-parts":[[2012,10,17]],"date-time":"2012-10-17T12:19:06Z","timestamp":1350476346000},"page":"703-715","source":"Crossref","is-referenced-by-count":45,"title":["Finding a robust assignment of flights to gates at Amsterdam Airport Schiphol"],"prefix":"10.1007","volume":"15","author":[{"given":"G.","family":"Diepen","sequence":"first","affiliation":[]},{"given":"J. M.","family":"van\u00a0den Akker","sequence":"additional","affiliation":[]},{"given":"J. A.","family":"Hoogeveen","sequence":"additional","affiliation":[]},{"given":"J. W.","family":"Smeltink","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,10,18]]},"reference":[{"key":"292_CR1","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C. Barnhart","year":"1998","unstructured":"Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P., & Vance, P. H. (1998). Branch-and-price: column generation for solving huge integer programs. Operations Research, 46, 316\u2013329.","journal-title":"Operations Research"},{"key":"292_CR2","first-page":"280","volume-title":"Proceedings of the 12th annual conference on computers and industrial engineering","author":"R. A. Bihr","year":"1990","unstructured":"Bihr, R. A. (1990). A conceptual solution to the aircraft gate assignment problem using 0,1 linear programming. In Proceedings of the 12th annual conference on computers and industrial engineering (pp. 280\u2013284). Elmsford: Pergamon Press"},{"key":"292_CR3","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 aircrafts. European Journal of Operational Research, 120, 63\u201380.","journal-title":"European Journal of Operational Research"},{"key":"292_CR4","volume-title":"Introduction to algorithms","author":"T. H. Cormen","year":"2001","unstructured":"Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2001). Introduction to algorithms (2nd ed.). Cambridge\/New York: MIT Press\/McGraw Hill.","edition":"2"},{"key":"292_CR5","doi-asserted-by":"crossref","unstructured":"Diepen, G., Pieters, B., van\u00a0den Akker, J., & Hoogeveen, J. (2011, in press). Robust planning of airport platform buses. Computers and Operations Research. Available at: http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305054811002267","DOI":"10.1016\/j.cor.2011.08.002"},{"key":"292_CR6","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":"292_CR7","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. Transportation Science, 42, 292\u2013301.","journal-title":"Transportation Science"},{"key":"292_CR8","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. Annals of Operations Research, 194, 177\u2013187. doi: 10.1007\/s10479-010-0809-8 .","journal-title":"Annals of Operations Research"},{"key":"292_CR9","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1080\/07408170701416673","volume":"40","author":"A. Drexl","year":"2008","unstructured":"Drexl, A., & Nikulin, N. (2008). Multicriteria airport gate assignment and Pareto simulated annealing. IIE Transactions, 40, 385\u2013397.","journal-title":"IIE Transactions"},{"key":"292_CR10","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1287\/trsc.1070.0227","volume":"42","author":"D. Espinoza","year":"2008","unstructured":"Espinoza, D., Garcia, R., Goycoolea, M., Nemhauser, G., & Savelsbergh, M. (2008a). Per-seat, on-demand air transportation part I: problem description and an integer multi-commodity flow model. Transportation Science, 42, 263\u2013278.","journal-title":"Transportation Science"},{"key":"292_CR11","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1287\/trsc.1070.0228","volume":"42","author":"D. Espinoza","year":"2008","unstructured":"Espinoza, D., Garcia, R., Goycoolea, M., Nemhauser, G., & Savelsbergh, M. (2008b). Per-seat, on-demand air transportation part II: parallel local search. Transportation Science, 42, 279\u2013291.","journal-title":"Transportation Science"},{"issue":"2","key":"292_CR12","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1287\/trsc.35.2.165.10135","volume":"35","author":"R. Freling","year":"2001","unstructured":"Freling, R., Wagelmans, A. P. M., & Paixao, J. M. P. (2001). Models and algorithms for single-depot vehicle scheduling. Transportation Science, 35(2), 165\u2013180.","journal-title":"Transportation Science"},{"key":"292_CR13","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/S0965-8564(98)00005-6","volume":"32","author":"A. Haghani","year":"1998","unstructured":"Haghani, A., & Chen, M.-C. (1998). Optimizing gate assignments at airport terminals. Transportation Research. Part A, Policy and Practice, 32, 437\u2013454.","journal-title":"Transportation Research. Part A, Policy and Practice"},{"key":"292_CR14","unstructured":"ILOG (2005). ILOG CPLEX v9.1. http:\/\/www.ilog.fr ."},{"key":"292_CR15","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s10951-009-0112-1","volume":"13","author":"N. Nikulin","year":"2010","unstructured":"Nikulin, N., & Drexl, A. (2010). Theoretical aspects of multicriteria flight gate scheduling: deterministic and fuzzy models. Journal of Scheduling, 13, 261\u2013280.","journal-title":"Journal of Scheduling"},{"key":"292_CR16","unstructured":"Van Orden, A. (2002). Gate assignment: methods and models. Master\u2019s thesis, Department of Mathematics, Utrecht University."},{"key":"292_CR17","volume-title":"HICSS\u201901: proceedings of the 34th annual Hawaii international conference on system sciences (HICSS-34)","author":"J. Xu","year":"2001","unstructured":"Xu, J., & Bailey, T. G. (2001). The airport gate assignment problem: mathematical model and a tabu search algorithm. In HICSS\u201901: proceedings of the 34th annual Hawaii international conference on system sciences (HICSS-34) (Vol.\u00a03)."},{"key":"292_CR18","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/S0965-8564(99)00065-8","volume":"35","author":"S. Yan","year":"2001","unstructured":"Yan, S., & Huo, C.-M. (2001). Optimization of multiple objective gate assignments. Transportation Research. Part A, Policy and Practice, 35, 413\u2013432.","journal-title":"Transportation Research. Part A, Policy and Practice"},{"issue":"5","key":"292_CR19","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1016\/S0965-8564(01)00045-3","volume":"36","author":"S. Yan","year":"2002","unstructured":"Yan, S., Shieh, C.-Y., & Chen, M. (2002). A simulation framework for evaluating airport gate assignments. Transportation Research. Part A, Policy and Practice, 36(5), 885\u2013898.","journal-title":"Transportation Research. Part A, Policy and Practice"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-012-0292-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-012-0292-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-012-0292-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:47Z","timestamp":1559453987000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-012-0292-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,18]]},"references-count":19,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["292"],"URL":"https:\/\/doi.org\/10.1007\/s10951-012-0292-y","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,18]]}}}