{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:33:35Z","timestamp":1740123215263,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,7,2]],"date-time":"2018-07-02T00:00:00Z","timestamp":1530489600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,7,2]],"date-time":"2018-07-02T00:00:00Z","timestamp":1530489600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMI-0421823"],"award-info":[{"award-number":["DMI-0421823"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Fisher College of Business"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s10479-018-2928-6","type":"journal-article","created":{"date-parts":[[2018,7,2]],"date-time":"2018-07-02T12:39:01Z","timestamp":1530535141000},"page":"249-269","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Online production planning to maximize the number of on-time orders"],"prefix":"10.1007","volume":"298","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4484-9252","authenticated-orcid":false,"given":"Nicholas G.","family":"Hall","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc E.","family":"Posner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris N.","family":"Potts","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,2]]},"reference":[{"key":"2928_CR1","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0167-6377(98)00045-5","volume":"24","author":"P Baptiste","year":"1999","unstructured":"Baptiste, P. (1999). An $$O(n^4)$$ algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Operations Research Letters, 24, 175\u2013180.","journal-title":"Operations Research Letters"},{"key":"2928_CR2","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1287\/opre.39.3.470","volume":"39","author":"JC Bean","year":"1991","unstructured":"Bean, J. C., Birge, J. R., Mittenthal, J., & Noon, C. E. (1991). Matchup scheduling with multiple resources, release dates and disruptions. Operations Research, 39, 470\u2013483.","journal-title":"Operations Research"},{"key":"2928_CR3","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","volume":"7","author":"M Blum","year":"1972","unstructured":"Blum, M., Floyd, R. W., Pratt, V. R., Rivest, R. L., & Tarjan, R. E. (1972). Time bounds for selection. Journal of Computer and System Sciences, 7, 448\u2013461.","journal-title":"Journal of Computer and System Sciences"},{"key":"2928_CR4","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1287\/msom.4.1.25.287","volume":"4","author":"S Chand","year":"2002","unstructured":"Chand, S., Hsu, V. N., & Sethi, S. (2002). Forecast, solution and rolling horizons in operations management problems: A classified bibliography. Manufacturing & Service Operations Management, 4, 25\u201343.","journal-title":"Manufacturing & Service Operations Management"},{"key":"2928_CR5","doi-asserted-by":"publisher","first-page":"1709","DOI":"10.1137\/S0097539704446608","volume":"36","author":"M Chrobak","year":"2006","unstructured":"Chrobak, M., Jawor, M., Sgall, J., & Tichy, T. (2006). Online scheduling of equal-length jobs: Randomization and restarts help. SIAM Journal on Computing, 36, 1709\u20131728.","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"2928_CR6","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1287\/mnsc.40.3.320","volume":"40","author":"FW Ciarallo","year":"1994","unstructured":"Ciarallo, F. W., Akella, R., & Morton, T. E. (1994). A periodic review, production planning model with uncertain capacity and uncertain demand\u2014optimality of extended myopic policies. Management Science, 40(3), 320\u2013332.","journal-title":"Management Science"},{"key":"2928_CR7","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.ipl.2008.05.020","volume":"108","author":"SPY Fung","year":"2008","unstructured":"Fung, S. P. Y. (2008). Lower bounds on online deadline scheduling with preemption penalties. Information Processing Letters, 108, 214\u2013218.","journal-title":"Information Processing Letters"},{"key":"2928_CR8","doi-asserted-by":"crossref","unstructured":"Geunes, J., Merzifonluo\u011flu, Y., Romeijn, H.E., & Taaffe, K. (2005). Demand selection and assignment problems in supply chain planning. Tutorials in Operations Research, INFORMS, pp. 124\u2013141.","DOI":"10.1287\/educ.1053.0014"},{"key":"2928_CR9","doi-asserted-by":"publisher","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"RL Graham","year":"1966","unstructured":"Graham, R. L. (1966). Bounds for certain multiprocessor anomalies. Bell System Technical Journal, 45, 1563\u20131581.","journal-title":"Bell System Technical Journal"},{"key":"2928_CR10","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1287\/moor.1080.0346","volume":"34","author":"NG Hall","year":"2009","unstructured":"Hall, N. G., Posner, M. E., & Potts, C. N. (2009). Online scheduling with known arrival times. Mathematics of Operations Research, 34, 92\u2013102.","journal-title":"Mathematics of Operations Research"},{"key":"2928_CR11","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0167-6377(00)00061-4","volume":"27","author":"H Hoogeveen","year":"2000","unstructured":"Hoogeveen, H., Potts, C. N., & Woeginger, G. J. (2000). On-line scheduling on a single machine: Maximizing the number of early jobs. Operations Research Letters, 27, 193\u2013197.","journal-title":"Operations Research Letters"},{"key":"2928_CR12","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1287\/mnsc.15.5.284","volume":"16","author":"E Ignall","year":"1969","unstructured":"Ignall, E., & Veinott, A. F, Jr. (1969). Optimality of myopic inventory policies for several substitute products. Management Science, 16, 284\u2013304.","journal-title":"Management Science"},{"key":"2928_CR13","unstructured":"Jackson, J. R. (1955). Scheduling a production line to minimize maximum tardiness. Research Report 43, Management Science Research Project, University of California, Los Angeles, CA."},{"key":"2928_CR14","unstructured":"Lawler, E. L. (1983). Scheduling a single machine to minimize the number of late jobs. Technical report, University of California at Berkeley, Berkeley, CA."},{"key":"2928_CR15","first-page":"343","volume":"1","author":"JK Lenstra","year":"1977","unstructured":"Lenstra, J. K., Rinnooy Kan, A. H. G., & Brucker, P. (1977). Complexity of machine scheduling problems. Annals of Operations Research, 1, 343\u2013362.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"2928_CR16","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1287\/msom.1120.0398","volume":"15","author":"C Li","year":"2013","unstructured":"Li, C., & Zhang, F. (2013). Advance demand information, price discrimination, and preorder strategies. Manufacturing & Service Operations Management, 15(1), 57\u201371.","journal-title":"Manufacturing & Service Operations Management"},{"key":"2928_CR17","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1287\/mnsc.23.7.728","volume":"23","author":"J McClain","year":"1977","unstructured":"McClain, J., & Thomas, L. J. (1977). Horizon effects in aggregate production planning with seasonal demands. Management Science, 23, 728\u2013736.","journal-title":"Management Science"},{"key":"2928_CR18","doi-asserted-by":"publisher","first-page":"46","DOI":"10.2307\/1905580","volume":"23","author":"F Modigliani","year":"1955","unstructured":"Modigliani, F., & Hohn, F. E. (1955). Production planning over time and the nature of the expectation and planning horizon. Econometrica, 23, 46\u201366.","journal-title":"Econometrica"},{"key":"2928_CR19","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1287\/mnsc.15.1.102","volume":"15","author":"JM Moore","year":"1968","unstructured":"Moore, J. M. (1968). An $$n$$ job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science, 15, 102\u2013109.","journal-title":"Management Science"},{"key":"2928_CR20","doi-asserted-by":"publisher","first-page":"2012","DOI":"10.1007\/978-1-4614-2361-4","volume-title":"Scheduling: Theory, algorithms and systems","author":"ML Pinedo","year":"2012","unstructured":"Pinedo, M. L. (2012). Scheduling: Theory, algorithms and systems (4th ed., p. 2012). Berlin: Springer.","edition":"4"},{"key":"2928_CR21","volume-title":"Handbook of scheduling: Algorithms, models and performance analysis","author":"K Pruhs","year":"2004","unstructured":"Pruhs, K., Sgall, J., & Torng, E. (2004). Online scheduling. In J. Y.-T. Leung (Ed.), Handbook of scheduling: Algorithms, models and performance analysis. Boca Raton, FL: CRC Press."},{"key":"2928_CR22","volume-title":"Operations management: An integrated approach","author":"RD Reid","year":"2005","unstructured":"Reid, R. D., & Sanders, N. R. (2005). Operations management: An integrated approach (2nd ed.). Hoboken, NJ: Wiley.","edition":"2"},{"key":"2928_CR23","volume-title":"Operations management: Quality and competitiveness in a global environment","author":"RS Russell","year":"2006","unstructured":"Russell, R. S., & Taylor, B. W, I. I. I. (2006). Operations management: Quality and competitiveness in a global environment (5th ed.). Hoboken, NJ: Wiley.","edition":"5"},{"key":"2928_CR24","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"WE Smith","year":"1956","unstructured":"Smith, W. E. (1956). Various optimizers for single stage production. Naval Research Logistics Quarterly, 3, 59\u201366.","journal-title":"Naval Research Logistics Quarterly"},{"issue":"2","key":"2928_CR25","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1111\/j.1937-5956.2009.01092.x","volume":"19","author":"X Zhao","year":"2010","unstructured":"Zhao, X., & Stecke, K. E. (2010). Pre-orders for new to-be-released products considering consumer loss aversion. Production and Operations Management, 19(2), 198\u2013215.","journal-title":"Production and Operations Management"},{"key":"2928_CR26","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10878-006-9027-3","volume":"13","author":"FF Zheng","year":"2007","unstructured":"Zheng, F. F., Xu, Y. F., & Zhang, E. (2007). On-line production order scheduling with production order penalties. Journal of Combinatorial Optimization, 13, 189\u2013204.","journal-title":"Journal of Combinatorial Optimization"},{"key":"2928_CR27","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.ipl.2007.10.008","volume":"106","author":"FF Zheng","year":"2008","unstructured":"Zheng, F. F., Xu, Y. F., & Zhang, E. (2008). How much can lookahead help in online single machine scheduling. Information Processing Letters, 106, 70\u201374.","journal-title":"Information Processing Letters"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-2928-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-018-2928-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-2928-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,13]],"date-time":"2021-02-13T20:41:44Z","timestamp":1613248904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-018-2928-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,2]]},"references-count":27,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["2928"],"URL":"https:\/\/doi.org\/10.1007\/s10479-018-2928-6","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2018,7,2]]},"assertion":[{"value":"2 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}