{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T14:17:38Z","timestamp":1648649858464},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,5,19]],"date-time":"2012-05-19T00:00:00Z","timestamp":1337385600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Manag Sci"],"published-print":{"date-parts":[[2012,11]]},"DOI":"10.1007\/s10287-012-0145-3","type":"journal-article","created":{"date-parts":[[2012,5,18]],"date-time":"2012-05-18T15:49:44Z","timestamp":1337356184000},"page":"459-481","source":"Crossref","is-referenced-by-count":2,"title":["Dynamic fleet scheduling with uncertain demand and customer flexibility"],"prefix":"10.1007","volume":"9","author":[{"given":"Jonathan P.","family":"Turner","sequence":"first","affiliation":[]},{"given":"Soonhui","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Mark S.","family":"Daskin","sequence":"additional","affiliation":[]},{"given":"Tito","family":"Homem-de-Mello","sequence":"additional","affiliation":[]},{"given":"Karen","family":"Smilowitz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,5,19]]},"reference":[{"issue":"1","key":"145_CR1","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.38.1.22","volume":"38","author":"KR Baker","year":"1990","unstructured":"Baker KR, Scudder GD (1990) Sequencing with earliness and tardiness penalties\u2014a review. Oper Res 38(1): 22\u201336","journal-title":"Oper Res"},{"key":"145_CR2","doi-asserted-by":"crossref","unstructured":"Bent R, Van Hentenryck P (2003) A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. In: Proceedings of the ninth international conference on constraint programming, pp 123\u2013137","DOI":"10.1007\/978-3-540-45193-8_9"},{"issue":"3","key":"145_CR3","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1287\/trsc.1050.0136","volume":"40","author":"AM Campbell","year":"2006","unstructured":"Campbell AM, Savelsbergh M (2006) Incentive schemes for attended home delivery services. Transp Sci 40(3): 327\u2013341","journal-title":"Transp Sci"},{"issue":"1","key":"145_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0207001","volume":"7","author":"EG Coffman","year":"1978","unstructured":"Coffman EG, Garey MR, Johnson DS (1978) Application of bin-packing to multiprocessor scheduling. SIAM J Comput 7(1): 1\u201317","journal-title":"SIAM J Comput"},{"issue":"1","key":"145_CR5","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0377-2217(90)90088-S","volume":"47","author":"H Emmons","year":"1990","unstructured":"Emmons H, Pinedo M (1990) Scheduling stochastic jobs with due dates on parallel machines. Eur J Oper Res 47(1): 49\u201355","journal-title":"Eur J Oper Res"},{"issue":"1","key":"145_CR6","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1287\/opre.26.1.68","volume":"26","author":"I Gertsbakh","year":"1978","unstructured":"Gertsbakh I, Stern HI (1978) Minimal resources for fixed and variable job schedules. Oper Res 26(1): 68\u201385","journal-title":"Oper Res"},{"issue":"1","key":"145_CR7","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1287\/trsc.36.1.21.570","volume":"36","author":"GA Godfrey","year":"2002","unstructured":"Godfrey GA, Powell WB (2002) An adaptive dynamic programming algorithm for dynamic fleet management, I: single period travel times. Transp Sci 36(1): 21\u201339","journal-title":"Transp Sci"},{"key":"145_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-77778-8","volume-title":"The vehicle routing problem: latest advances and new challenges","author":"B Golden","year":"2008","unstructured":"Golden B, Raghavan S, Wasil E (2008) The vehicle routing problem: latest advances and new challenges. Springer, Berlin"},{"issue":"2","key":"145_CR9","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1287\/trsc.1050.0114","volume":"40","author":"S Ichoua","year":"2006","unstructured":"Ichoua S, Gendreau M, Potvin JY (2006) Exploiting knowledge about future demands for real-time vehicle dispatching. Transp Sci 40(2): 211\u2013225","journal-title":"Transp Sci"},{"issue":"1","key":"145_CR10","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1287\/trsc.37.1.69.12820","volume":"37","author":"AS Kenyon","year":"2003","unstructured":"Kenyon AS, Morton DP (2003) Stochastic vehicle routing with random travel times. Transp Sci 37(1): 69\u201382","journal-title":"Transp Sci"},{"issue":"2","key":"145_CR11","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1137\/S1052623499363220","volume":"12","author":"AJ Kleywegt","year":"2002","unstructured":"Kleywegt AJ, Shapiro A, Homem-de-Mello T (2002) The sample average approximation method for stochastic discrete optimization. SIAM J Optim 12(2): 479\u2013502","journal-title":"SIAM J Optim"},{"issue":"1","key":"145_CR12","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/j.ejor.2011.10.019","volume":"218","author":"S Lee","year":"2012","unstructured":"Lee S, Turner J, Daskin MS, Homem-de-Mello T, Smilowitz K (2012) Improving fleet utilization for carriers by interval scheduling. Eur J Oper Res 218(1): 261\u2013269","journal-title":"Eur J Oper Res"},{"issue":"1","key":"145_CR13","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s10479-006-6169-8","volume":"142","author":"JT Linderoth","year":"2006","unstructured":"Linderoth JT, Shapiro A, Wright SJ (2006) The empirical behavior of sampling methods for stochastic programming. Ann Oper Res 142(1): 215\u2013241","journal-title":"Ann Oper Res"},{"issue":"3","key":"145_CR14","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":"1\u20132","key":"145_CR15","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/S0167-6377(98)00054-6","volume":"24","author":"WK Mak","year":"1999","unstructured":"Mak WK, Morton DP, Wood RK (1999) Monte Carlo bounding techniques for determining solution quality in stochastic programs. Oper Res Lett 24(1\u20132): 47\u201356","journal-title":"Oper Res Lett"},{"key":"145_CR16","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1287\/moor.1060.0201","volume":"31","author":"N Megow","year":"2006","unstructured":"Megow N, Uetz M, Vredeveld T (2006) Models and algorithms for stochastic online scheduling. Math Oper Res 31: 513\u2013525","journal-title":"Math Oper Res"},{"issue":"3","key":"145_CR17","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1287\/trsc.1070.0225","volume":"42","author":"F Papier","year":"2008","unstructured":"Papier F, Thonemann UW (2008) Queuing models for sizing and structuring rental fleets. Transp Sci 42(3): 302\u2013317","journal-title":"Transp Sci"},{"issue":"3","key":"145_CR18","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1287\/opre.31.3.559","volume":"31","author":"M Pinedo","year":"1983","unstructured":"Pinedo M (1983) Stochastic scheduling with release dates and due dates. Oper Res 31(3): 559\u2013572","journal-title":"Oper Res"},{"key":"145_CR19","volume-title":"Handbook of stochastic optimization","author":"A Shapiro","year":"2003","unstructured":"Shapiro A (2003) Monte Carlo sampling methods. In: Ruszczynski A, Shapiro A (eds) Handbook of stochastic optimization. Elsevier Science Publishers BV, Amsterdam"},{"key":"145_CR20","doi-asserted-by":"crossref","unstructured":"Shmoys DB, Wein J, Williamson DP (1991) Scheduling parallel machines online. In: Proceedings-32nd annual symposium on foundations of computer science, pp 131\u2013140","DOI":"10.1109\/SFCS.1991.185361"},{"issue":"4","key":"145_CR21","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1287\/trsc.1060.0153","volume":"40","author":"BC Smith","year":"2006","unstructured":"Smith BC, Johnson EL (2006) Robust airline fleet assignment: imposing station purity using station decomposition. Transp Sci 40(4): 497\u2013516","journal-title":"Transp Sci"},{"issue":"4","key":"145_CR22","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1287\/trsc.1030.0073","volume":"38","author":"MZ Spivey","year":"2004","unstructured":"Spivey MZ, Powell WB (2004) The dynamic assignment problem. Transp Sci 38(4): 399\u2013419","journal-title":"Transp Sci"},{"issue":"1","key":"145_CR23","doi-asserted-by":"crossref","first-page":"167","DOI":"10.2307\/3213926","volume":"19","author":"RR Weber","year":"1982","unstructured":"Weber RR (1982) Scheduling jobs with stochastic processing requirements on parallel machines to minimize makespan or flowtime. J Appl Probab 19(1): 167\u2013182","journal-title":"J Appl Probab"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-012-0145-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10287-012-0145-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-012-0145-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T21:57:44Z","timestamp":1561759064000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10287-012-0145-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,19]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,11]]}},"alternative-id":["145"],"URL":"https:\/\/doi.org\/10.1007\/s10287-012-0145-3","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"value":"1619-697X","type":"print"},{"value":"1619-6988","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,19]]}}}