{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:01:38Z","timestamp":1725534098974},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020933"},{"type":"electronic","value":"9783642020940"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02094-0_8","type":"book-chapter","created":{"date-parts":[[2009,6,27]],"date-time":"2009-06-27T14:45:07Z","timestamp":1246113907000},"page":"140-165","source":"Crossref","is-referenced-by-count":3,"title":["From State-of-the-Art Static Fleet Assignment to Flexible Stochastic Planning of the Future"],"prefix":"10.1007","author":[{"given":"Sven","family":"Grothklags","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulf","family":"Lorenz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Burkhard","family":"Monien","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"8_CR1","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1287\/inte.19.4.20","volume":"19","author":"J. Abara","year":"1989","unstructured":"Abara, J.: Applying integer linear programming to the fleet assignment problem. Interfaces\u00a019(4), 20\u201328 (1989)","journal-title":"Interfaces"},{"issue":"3","key":"8_CR2","first-page":"55","volume":"11","author":"I. Alth\u00f6fer","year":"1988","unstructured":"Alth\u00f6fer, I.: Root evaluation errors: How they arise and propagate. ICCA Journal\u00a011(3), 55\u201363 (1988)","journal-title":"ICCA Journal"},{"issue":"3","key":"8_CR3","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/S0004-3702(83)80015-0","volume":"21","author":"B.W. Ballard","year":"1983","unstructured":"Ballard, B.W.: The *-minimax search procedure for trees containing chance nodes. Artificial Intelligence\u00a021(3), 327\u2013350 (1983)","journal-title":"Artificial Intelligence"},{"key":"8_CR4","unstructured":"Barnhart, C., Boland, N.L., Clarke, L.W., Shenoi, R.G.: Flight strings models for aircraft fleeting and routing. Technical report. MIT Cambridge (1997)"},{"key":"8_CR5","unstructured":"Belanger, N., Desaulniers, G., Soumis, F., Desrosiers, J., Lavigne, J.: Airline fleet assignment with homogeneity. Technical report, GERAD, Montr\u00e9al (2002)"},{"issue":"1","key":"8_CR6","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1287\/opre.41.1.153","volume":"41","author":"M.A. Berge","year":"1993","unstructured":"Berge, M.A., Hopperstad, C.A.: Demand driven dispatch: A method for dynamic aircraft capacity assignment, models and algorithms. Operations Research\u00a041(1), 153\u2013168 (1993)","journal-title":"Operations Research"},{"key":"8_CR7","unstructured":"Clarke, L.W., Hane, C.A., Johnson, E.L., Nemhauser, G.L.: Maintenance and crew considerations in fleet assignment. Technical report (1994)"},{"issue":"6","key":"8_CR8","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1287\/mnsc.43.6.841","volume":"43","author":"G. Desaulniers","year":"1997","unstructured":"Desaulniers, G., Desrosiers, J., Dumas, Y., Solomon, M.M., Soumis, F.: Daily aircraft routing and scheduling. Management Science\u00a043(6), 841\u2013855 (1997)","journal-title":"Management Science"},{"key":"8_CR9","unstructured":"Ehrhoff, J., Grothklags, S., Lorenz, U.: Das Reparaturspiel als Formalisierung von Planung unter Zufallseinfl\u00fcssen, angewendet in der Flugplanung. In: Proceedings of GOR conference: Entscheidungsunterst\u00fctzende Systeme in Supply Chain Managment und Logistik, pp. 335\u2013356. Physika-Verlag (2005)"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Engell, S., M\u00e4rkert, A., Sand, G., Schultz, R.: Production planning in a multiproduct batch plant under uncertainty. Preprint 495-2001, FB Mathematik, Gerhard-Mercator-Universit\u00e4t Duisburg (2001)","DOI":"10.1007\/978-3-662-04331-8_32"},{"key":"8_CR11","first-page":"94","volume-title":"6th ACM Annual symposium on parallel algorithms and architectures (SPAA 1994)","author":"R. Feldmann","year":"1994","unstructured":"Feldmann, R., Mysliwietz, M., Monien, B.: Studying overheads in massively parallel min\/max-tree evaluation. In: 6th ACM Annual symposium on parallel algorithms and architectures (SPAA 1994), pp. 94\u2013104. ACM, New York (1994)"},{"issue":"3","key":"8_CR12","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1145\/5666.5673","volume":"29","author":"P.J. Flemming","year":"1986","unstructured":"Flemming, P.J., Wallace, J.J.: How not to lie with statistics: the correct way to summerize benchmark results. CACM\u00a029(3), 218\u2013221 (1986)","journal-title":"CACM"},{"issue":"1","key":"8_CR13","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1287\/trsc.11.1.20","volume":"11","author":"I. Gertsbach","year":"1977","unstructured":"Gertsbach, I., Gurevich, Y.: Constructing an optimal fleet for a transportation schedule. Transportation Science\u00a011(1), 20\u201336 (1977)","journal-title":"Transportation Science"},{"key":"8_CR14","unstructured":"G\u00f6tz, S., Grothklags, S., Kliewer, G., Tsch\u00f6ke, S.: Solving the weekly fleet assignment problem for large airlines. In: MIC 1999, pp. 241\u2013246 (1999)"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0167-6377(94)90001-9","volume":"15","author":"Z. Gu","year":"1994","unstructured":"Gu, Z., Johnson, E.L., Nemhauser, G.L., Wang, Y.: Some properties of the fleet assignment problem. Operations Research Letters\u00a015, 59\u201371 (1994)","journal-title":"Operations Research Letters"},{"key":"8_CR16","first-page":"211","volume":"70","author":"C.A. Hane","year":"1995","unstructured":"Hane, C.A., Barnhart, C., Johnson, E.L., Marsten, R.E., Nemhauser, G.L., Sigismondi, G.: The fleet assignment problem: solving a large-scale integer program. Mathematical Programming\u00a070, 211\u2013232 (1995)","journal-title":"Mathematical Programming"},{"key":"8_CR17","unstructured":"Kaindl, H., Scheucher, A.: The reason for the benefits of minmax search. In: Proc. of the 11th IJCAI, Detroit, MI, pp. 322\u2013327 (1989)"},{"key":"8_CR18","unstructured":"Kniker, T.S., Barnhart, C.: Shortcomings of the conventional fleet assignment model. Technical report. MIT, Cambridge (1998)"},{"issue":"4","key":"8_CR19","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","volume":"6","author":"D.E. Knuth","year":"1975","unstructured":"Knuth, D.E., Moore, R.W.: An analysis of alpha-beta pruning. Artificial Intelligence\u00a06(4), 293\u2013326 (1975)","journal-title":"Artificial Intelligence"},{"key":"8_CR20","unstructured":"Koenig, S., Furcy, D., Bauer, C.: Heuristic search-based replanning. In: Proceedings of the International Conference on Artificial Intelligence Planning and Scheduling, pp. 294\u2013301 (2002)"},{"issue":"5","key":"8_CR21","first-page":"421","volume":"32","author":"P. Kouvelis","year":"2000","unstructured":"Kouvelis, P., Daniels, R.L., Vairaktarakis, G.: Robust scheduling of a two-machine flow shop with uncertain processing times. IIE Transactions\u00a032(5), 421\u2013432 (2000)","journal-title":"IIE Transactions"},{"issue":"6","key":"8_CR22","doi-asserted-by":"publisher","first-page":"1451","DOI":"10.1080\/00207549408957010","volume":"32","author":"V.J. Leon","year":"1994","unstructured":"Leon, V.J., Wu, S.D., Storer, R.h.: A game-theoretic control approach for job shops in the presence of disruptions. International Journal of Production Research\u00a032(6), 1451\u20131476 (1994)","journal-title":"International Journal of Production Research"},{"issue":"1-2","key":"8_CR23","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0004-3702(83)80011-3","volume":"21","author":"D.S. Nau","year":"1983","unstructured":"Nau, D.S.: Pathology on game trees revisited, and an alternative to minimaxing. Artificial Intelligence\u00a021(1-2), 221\u2013244 (1983)","journal-title":"Artificial Intelligence"},{"key":"8_CR24","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"I.H. Osman","year":"1993","unstructured":"Osman, I.H.: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research\u00a041, 421\u2013451 (1993)","journal-title":"Annals of Operations Research"},{"key":"8_CR25","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/0022-0000(85)90045-5","volume":"31","author":"C.H. Papadimitriou","year":"1985","unstructured":"Papadimitriou, C.H.: Games against nature. Journal of Computer and System Science\u00a031, 288\u2013301 (1985)","journal-title":"Journal of Computer and System Science"},{"key":"8_CR26","unstructured":"Radicke, U.-D.: Algorithmen f\u00fcr das Fleet Assignment von Flugpl\u00e4nen. Verlag Shaker (1994)"},{"issue":"4","key":"8_CR27","first-page":"4","volume":"6","author":"A. Reinefeld","year":"1983","unstructured":"Reinefeld, A.: An Improvement of the Scout Tree Search Algorithm. ICCA Journal\u00a06(4), 4\u201314 (1983)","journal-title":"ICCA Journal"},{"key":"8_CR28","doi-asserted-by":"crossref","unstructured":"R\u00f6misch, W., Schultz, R.: Multistage stochastic integer programming: an introduction. In: Online Optimization of Large Scale Systems, pp. 581\u2013600 (2001)","DOI":"10.1007\/978-3-662-04331-8_29"},{"key":"8_CR29","doi-asserted-by":"crossref","unstructured":"Rosenberger, J.M., Schaefer, A.J., Goldsman, D., Johnson, E.L., Kleywegt, A.J., Nemhauser, G.L.: Simair: A stochastic model of airline operations. In: Winter Simulation Conference Proceedings (2000)","DOI":"10.1109\/WSC.2000.899074"},{"issue":"2","key":"8_CR30","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1287\/trsc.31.2.159","volume":"31","author":"R.A. Rushmeier","year":"1997","unstructured":"Rushmeier, R.A., Kontogiorgis, S.A.: Advances in the optimization of airline fleet assignment. Transportation Science\u00a031(2), 159\u2013169 (1997)","journal-title":"Transportation Science"},{"key":"8_CR31","unstructured":"Russel, S., Norvig, P.: Artificial Intelligence, A Modern Approach. Prentice Hall Series in Artificial Intelligence (2003)"},{"key":"8_CR32","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1080\/14786445008521796","volume":"41","author":"C.E. Shannon","year":"1950","unstructured":"Shannon, C.E.: Programming a computer for playing chess. Philosophical Magazine\u00a041, 256\u2013275 (1950)","journal-title":"Philosophical Magazine"},{"key":"8_CR33","unstructured":"Sharma, D., Ahuja, R.K., Orlin, J.B.: Neighborhood search algorithms for the combined through-fleet assignment model. Talk at ISMP 2000 (2000)"},{"key":"8_CR34","volume-title":"Approximation and Complexity in Numerical Optimization","author":"D. Sosnowska","year":"2000","unstructured":"Sosnowska, D.: Optimization of a simplified fleet assignment problem with metaheuristics: Simulated annealing and GRASP. In: Pardalos, P.M. (ed.) Approximation and Complexity in Numerical Optimization. Kluwer Academic Publisher, Dordrecht (2000)"},{"issue":"1","key":"8_CR35","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1287\/inte.24.1.104","volume":"24","author":"R. Subramanian","year":"1994","unstructured":"Subramanian, R., Sheff, R.P., Quillinan, J.D., Wiper, D.S., Marsten, R.E.: Coldstart: Fleet assignment at Delta Air Lines. Interfaces\u00a024(1), 104\u2013120 (1994)","journal-title":"Interfaces"},{"issue":"3","key":"8_CR36","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1287\/trsc.30.3.237","volume":"30","author":"K.T. Talluri","year":"1996","unstructured":"Talluri, K.T.: Swapping applications in a daily airline fleet assignment. Transportation Science\u00a030(3), 237\u2013248 (1996)","journal-title":"Transportation Science"}],"container-title":["Lecture Notes in Computer Science","Algorithmics of Large and Complex Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02094-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T20:38:12Z","timestamp":1685047092000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02094-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020933","9783642020940"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02094-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}