{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:45:27Z","timestamp":1740149127548,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,7,10]],"date-time":"2019-07-10T00:00:00Z","timestamp":1562716800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,7,10]],"date-time":"2019-07-10T00:00:00Z","timestamp":1562716800000},"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":["Oper Res Int J"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s12351-019-00506-z","type":"journal-article","created":{"date-parts":[[2019,7,10]],"date-time":"2019-07-10T12:03:47Z","timestamp":1562760227000},"page":"2489-2523","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Online optimization with gradual look-ahead"],"prefix":"10.1007","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4805-9576","authenticated-orcid":false,"given":"Fabian","family":"Dunke","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Nickel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,10]]},"reference":[{"issue":"6","key":"506_CR1","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1016\/j.orl.2010.09.010","volume":"38","author":"L Ahlroth","year":"2010","unstructured":"Ahlroth L, Schumacher A, Haanp\u00e4\u00e4 H (2010) On the power of lookahead in online lot-sizing. Oper Res Lett 38(6):522\u2013526","journal-title":"Oper Res Lett"},{"issue":"3","key":"506_CR2","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/PL00009158","volume":"18","author":"S Albers","year":"1997","unstructured":"Albers S (1997) On the influence of lookahead in competitive paging algorithms. Algorithmica 18(3):283\u2013305","journal-title":"Algorithmica"},{"issue":"1\u20132","key":"506_CR3","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0304-3975(97)00026-1","volume":"197","author":"S Albers","year":"1998","unstructured":"Albers S (1998) A competitive analysis of the list update problem with lookahead. Theor Comput Sci 197(1\u20132):95\u2013109","journal-title":"Theor Comput Sci"},{"key":"506_CR4","doi-asserted-by":"crossref","unstructured":"Allulli L, Ausiello G, Laura L (2005) On the power of lookahead in on-line vehicle routing problems. In: Lecture notes in computer science 3595: proceedings of the 11th annual international conference on computing and combinatorics. Springer, Berlin, pp 728\u2013736","DOI":"10.1007\/11533719_74"},{"issue":"2\u20133","key":"506_CR5","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.tcs.2008.08.003","volume":"408","author":"L Allulli","year":"2008","unstructured":"Allulli L, Ausiello G, Bonifaci V, Laura L (2008) On the power of lookahead in on-line server routing problems. Theor Comput Sci 408(2\u20133):116\u2013128","journal-title":"Theor Comput Sci"},{"issue":"12","key":"506_CR6","doi-asserted-by":"publisher","first-page":"1867","DOI":"10.1016\/j.cor.2011.02.021","volume":"38","author":"E Angelelli","year":"2011","unstructured":"Angelelli E, Mansini R, Vindigni M (2011) Look-ahead heuristics for the dynamic traveling purchaser problem. Comput Oper Res 38(12):1867\u20131876","journal-title":"Comput Oper Res"},{"key":"506_CR7","doi-asserted-by":"crossref","unstructured":"Ausiello G, Allulli L, Bonifaci V, Laura L (2006) On-line algorithms, real time, the virtue of laziness, and the power of clairvoyance. In: Lecture notes in computer science 3959: proceedings of the 3rd international conference on theory and applications of models of computation. Springer, Berlin, pp 1\u201320","DOI":"10.1007\/11750321_1"},{"issue":"2","key":"506_CR8","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1287\/moor.13.2.295","volume":"13","author":"C Bes","year":"1988","unstructured":"Bes C, Sethi S (1988) Concepts of forecast and decision horizons: applications to dynamic stochastic optimization problems. Math Oper Res 13(2):295\u2013310","journal-title":"Math Oper Res"},{"key":"506_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0237-4","volume-title":"Introduction to stochastic programming","author":"J Birge","year":"2011","unstructured":"Birge J, Louveaux F (2011) Introduction to stochastic programming, 2nd edn. Springer, Berlin","edition":"2"},{"issue":"1\u20132","key":"506_CR10","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0304-3975(98)00118-2","volume":"209","author":"D Breslauer","year":"1998","unstructured":"Breslauer D (1998) On competitive on-line paging with lookahead. Theor Comput Sci 209(1\u20132):365\u2013375","journal-title":"Theor Comput Sci"},{"key":"506_CR11","first-page":"23","volume":"197","author":"S Chand","year":"2014","unstructured":"Chand S, Sethi S (2014) Multi-period lot-sizing with stationary demand: extension to forecast horizons. Int Ser Oper Res Manag Sci 197:23\u201342","journal-title":"Int Ser Oper Res Manag Sci"},{"key":"506_CR12","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.ijpe.2018.04.012","volume":"202","author":"E Curcio","year":"2018","unstructured":"Curcio E, Amorim P, Zhang Q, Almada-Lobo B (2018) Adaptation and approximate strategies for solving the lot-sizing and scheduling problem under multistage demand uncertainty. Int J Prod Econ 202:81\u201396","journal-title":"Int J Prod Econ"},{"issue":"1","key":"506_CR13","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1147\/sj.71.0030","volume":"7","author":"J DeMatteis","year":"1968","unstructured":"DeMatteis J (1968) An economic lot-sizing technique: the part-period algorithm. IBM Syst J 7(1):30\u201338","journal-title":"IBM Syst J"},{"key":"506_CR14","unstructured":"Dunke F (2014) Online optimization with lookahead. Ph.D. thesis, Karlsruhe Institute of Technology"},{"key":"506_CR15","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.omega.2015.10.009","volume":"63","author":"F Dunke","year":"2016","unstructured":"Dunke F, Nickel S (2016) A general modeling approach to online optimization with lookahead. Omega 63:134\u2013153","journal-title":"Omega"},{"issue":"3","key":"506_CR16","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1016\/j.ejor.2016.07.016","volume":"264","author":"F Dunke","year":"2018","unstructured":"Dunke F, Heckmann I, Nickel S, Saldanha-da Gama F (2018) Time traps in supply chains: is optimal still good enough? Eur J Oper Res 264(3):813\u2013829","journal-title":"Eur J Oper Res"},{"key":"506_CR17","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-55309-7_4","volume-title":"Supply chain management and advanced planning: concepts, models, software, and case studies","author":"B Fleischmann","year":"2015","unstructured":"Fleischmann B, Meyr H, Wagner M (2015) Advanced planning. In: Stadtler H, Kilger C, Meyr H (eds) Supply chain management and advanced planning: concepts, models, software, and case studies, 5th edn. Springer, Berlin, pp 71\u201395","edition":"5"},{"issue":"1","key":"506_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(02)00915-3","volume":"151","author":"G Ghiani","year":"2003","unstructured":"Ghiani G, Guerriero F, Laporte G, Musmanno R (2003) Real-time vehicle routing: solution concepts, algorithms and parallel computing strategies. Eur J Oper Res 151(1):1\u201311","journal-title":"Eur J Oper Res"},{"key":"506_CR19","volume-title":"Introduction to logistics systems planning and control","author":"G Ghiani","year":"2004","unstructured":"Ghiani G, Laporte G, Musmanno R (2004) Introduction to logistics systems planning and control. Wiley, New York"},{"issue":"1","key":"506_CR20","first-page":"47","volume":"20","author":"G Groff","year":"1979","unstructured":"Groff G (1979) A lot sizing rule for time-phased component demand. Prod Inventory Manag 20(1):47\u201353","journal-title":"Prod Inventory Manag"},{"key":"506_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-55928-0","volume-title":"Planning stability in material requirements planning systems","author":"G Heisig","year":"2002","unstructured":"Heisig G (2002) Planning stability in material requirements planning systems. Springer, Berlin"},{"issue":"2","key":"506_CR22","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1002\/net.20454","volume":"58","author":"P Jaillet","year":"2011","unstructured":"Jaillet P, Lu X (2011) Online traveling salesman problems with service flexibility. Networks 58(2):137\u2013146","journal-title":"Networks"},{"issue":"2","key":"506_CR23","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1287\/trsc.1060.0147","volume":"40","author":"P Jaillet","year":"2006","unstructured":"Jaillet P, Wagner M (2006) Online routing problems: value of advanced information as improved competitive ratios. Transp Sci 40(2):200\u2013210","journal-title":"Transp Sci"},{"key":"506_CR24","volume-title":"Real optimization with SAP APO","author":"J Kallrath","year":"2006","unstructured":"Kallrath J, Maindl T (2006) Real optimization with SAP APO. Springer, Berlin"},{"issue":"3","key":"506_CR25","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1016\/j.ejor.2007.12.037","volume":"194","author":"JQ Li","year":"2009","unstructured":"Li JQ, Mirchandani P, Borenstein D (2009) Real-time vehicle rerouting problems with time windows. Eur J Oper Res 194(3):711\u2013727","journal-title":"Eur J Oper Res"},{"issue":"8","key":"506_CR26","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1139\/l07-029","volume":"34","author":"M Lu","year":"2007","unstructured":"Lu M, Dai F, Chen W (2007) Real-time decision support for planning concrete plant operations enabled by integrating vehicle tracking technology, simulation, and optimization algorithms. Can J Civ Eng 34(8):912\u2013922","journal-title":"Can J Civ Eng"},{"issue":"2","key":"506_CR27","first-page":"64","volume":"14","author":"E Meal","year":"1973","unstructured":"Meal E, Silver H (1973) A heuristic for selecting lot size quantities for the case of a deterministic time-varying demand rate and discrete opportunities for replenishment. Prod Inventory Manag 14(2):64\u201374","journal-title":"Prod Inventory Manag"},{"issue":"8","key":"506_CR28","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1016\/j.trb.2003.09.001","volume":"38","author":"S Mitrovic-Minic","year":"2004","unstructured":"Mitrovic-Minic S, Krishnamurti R, Laporte G (2004) Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows. Transp Res Part B Methodol 38(8):669\u2013685","journal-title":"Transp Res Part B Methodol"},{"issue":"2","key":"506_CR29","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/j.ejor.2008.03.023","volume":"196","author":"C Novoa","year":"2009","unstructured":"Novoa C, Storer R (2009) An approximate dynamic programming approach for the vehicle routing problem with stochastic demands. Eur J Oper Res 196(2):509\u2013515","journal-title":"Eur J Oper Res"},{"issue":"C","key":"506_CR30","first-page":"141","volume":"8","author":"W Powell","year":"1995","unstructured":"Powell W, Jaillet P, Odoni A (1995) Stochastic and dynamic networks and routing. Handb Oper Res Manag Sci 8(C):141\u2013295","journal-title":"Handb Oper Res Manag Sci"},{"key":"506_CR31","volume-title":"Markov decision processes: discrete stochastic dynamic programming","author":"M Puterman","year":"2005","unstructured":"Puterman M (2005) Markov decision processes: discrete stochastic dynamic programming. Wiley, New York"},{"key":"506_CR32","volume-title":"Introduction to stochastic dynamic programming","author":"S Ross","year":"1995","unstructured":"Ross S (1995) Introduction to stochastic dynamic programming, 6th edn. Academic Press, New York","edition":"6"},{"issue":"4","key":"506_CR33","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/s11740-011-0320-3","volume":"5","author":"G Schuh","year":"2011","unstructured":"Schuh G, Stich V, Brosze T, Fuchs S, Pulz C, Quick J, Sch\u00fcrmeyer M, Bauhoff F (2011) High resolution supply chain management: optimized processes based on self-optimizing control loops and real time data. Prod Eng 5(4):433\u2013442","journal-title":"Prod Eng"},{"issue":"1","key":"506_CR34","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/BF02283607","volume":"29","author":"S Sethi","year":"1991","unstructured":"Sethi S, Sorger G (1991) A theory of rolling horizon decision making. Ann Oper Res 29(1):387\u2013415","journal-title":"Ann Oper Res"},{"key":"506_CR35","volume-title":"Inventory management and production planning and scheduling","author":"E Silver","year":"1998","unstructured":"Silver E, Pyke D, Peterson R (1998) Inventory management and production planning and scheduling, 3rd edn. Wiley, New York","edition":"3"},{"key":"506_CR36","volume-title":"Supply chain management and advanced planning: concepts, models, software, and case studies","year":"2015","unstructured":"Stadtler H, Kilger C (eds) (2015) Supply chain management and advanced planning: concepts, models, software, and case studies, 5th edn. Springer, Berlin","edition":"5"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-019-00506-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-019-00506-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-019-00506-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,22]],"date-time":"2021-10-22T18:18:27Z","timestamp":1634926707000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-019-00506-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,10]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["506"],"URL":"https:\/\/doi.org\/10.1007\/s12351-019-00506-z","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"type":"print","value":"1109-2858"},{"type":"electronic","value":"1866-1505"}],"subject":[],"published":{"date-parts":[[2019,7,10]]},"assertion":[{"value":"22 January 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 June 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 July 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}