{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T03:32:44Z","timestamp":1648611164794},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,5,18]],"date-time":"2012-05-18T00:00:00Z","timestamp":1337299200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1007\/s10878-012-9502-y","type":"journal-article","created":{"date-parts":[[2012,5,17]],"date-time":"2012-05-17T15:54:34Z","timestamp":1337270074000},"page":"182-198","source":"Crossref","is-referenced-by-count":2,"title":["Competitive analysis for make-to-order scheduling with reliable lead time quotation"],"prefix":"10.1007","volume":"27","author":[{"given":"Feifeng","family":"Zheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinfeng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei-Chiang","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,5,18]]},"reference":[{"issue":"3","key":"9502_CR1","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1287\/opre.1080.0608","volume":"57","author":"B Ata","year":"2009","unstructured":"Ata B, Olsen TL (2009) Near-optimal dynamic lead-time quotation and scheduling under convex-concave customer delay costs. Oper Res 57(3):753\u2013768","journal-title":"Oper Res"},{"key":"9502_CR2","first-page":"2","volume-title":"Online computation and competitive analysis","author":"A Borodin","year":"1998","unstructured":"Borodin A, El-Yaniv R (1998) Online computation and competitive analysis. Cambridge University Press, Cambridge, pp 2\u20135 (Chapter 1)"},{"issue":"4\u20135","key":"9502_CR3","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/s10845-005-1663-4","volume":"16","author":"P Chang","year":"2005","unstructured":"Chang P, Hieh J, Liao TW (2005) Evolving fuzzy rules for due date assignment problem in semiconductor manufacturing factory. J Intell Manuf 16(4\u20135):549\u2013557","journal-title":"J Intell Manuf"},{"key":"9502_CR4","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1287\/mnsc.41.1.43","volume":"41","author":"I Duenyas","year":"1995","unstructured":"Duenyas I, Hopp WJ (1995) Quoting customer lead times. Manag Sci 41:43\u201357","journal-title":"Manag Sci"},{"issue":"2","key":"9502_CR5","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1080\/00207547608956596","volume":"14","author":"S Eilon","year":"1976","unstructured":"Eilon S, Chowdhury IG (1976) Due dates in job shop scheduling. Int J Prod Res 14(2):223\u2013237","journal-title":"Int J Prod Res"},{"key":"9502_CR6","first-page":"389","volume-title":"16th annual international computing and combinatorics conference, Nha Trang, Vietnam","author":"SPY Fung","year":"2010","unstructured":"Fung SPY (2010) Online preemptive scheduling with immediate decision or notification and penalties. In: 16th annual international computing and combinatorics conference, Nha Trang, Vietnam, pp 389\u2013398"},{"issue":"3","key":"9502_CR7","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1023\/A:1022956425198","volume":"6","author":"MH Goldwasser","year":"2003","unstructured":"Goldwasser MH, Kerbikov B (2003) Admission control with immediate notification. J Sched 6(3):269\u2013285","journal-title":"J Sched"},{"issue":"5","key":"9502_CR8","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1287\/opre.39.5.836","volume":"39","author":"NG Hall","year":"1991","unstructured":"Hall NG, Posner ME (1991) Earliness-tardiness scheduling problems, I: weighted deviation of completion times about a common due date. Oper Res 39(5):836\u2013846","journal-title":"Oper Res"},{"key":"9502_CR9","volume-title":"Introduction to supply chain management","author":"RB Handfield","year":"1999","unstructured":"Handfield RB, Nichols EL (1999) Introduction to supply chain management. Prentice Hall, New York"},{"issue":"9","key":"9502_CR10","doi-asserted-by":"crossref","first-page":"1727","DOI":"10.1080\/00207540310001624375","volume":"42","author":"SY Hsu","year":"2004","unstructured":"Hsu SY, Sha DY (2004) Due date assignment using artificial neural networks under different shop floor control strategies. Int J Prod Res 42(9):1727\u20131745","journal-title":"Int J Prod Res"},{"key":"9502_CR11","volume-title":"Handbook on scheduling algorithms, methods and models","author":"P Kaminsky","year":"2004","unstructured":"Kaminsky P, Hochbaum D (2004) Due date quotation models and algorithms. In: Leung JY (ed) Handbook on scheduling algorithms, methods and models. Chapman Hall\/CRC, London"},{"issue":"3","key":"9502_CR12","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s10951-008-0053-0","volume":"11","author":"P Kaminsky","year":"2008","unstructured":"Kaminsky P, Lee ZH (2008) Effective on-line algorithms for reliable due date quotation and large-scale scheduling. J Sched 11(3):187\u2013204","journal-title":"J Sched"},{"issue":"2","key":"9502_CR13","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1287\/mnsc.47.2.264.9836","volume":"47","author":"P Keskinocak","year":"2001","unstructured":"Keskinocak P, Ravi R, Tayur S (2001) Scheduling and reliable lead-time quotation for orders with availability intervals and lead-time sensitive revenues. Manag Sci 47(2):264\u2013279","journal-title":"Manag Sci"},{"issue":"6","key":"9502_CR14","doi-asserted-by":"crossref","first-page":"1681","DOI":"10.1016\/j.cor.2004.11.014","volume":"33","author":"V Portougal","year":"2006","unstructured":"Portougal V, Trietsch D (2006) Setting due dates in a stochastic single machine environment. Comput Oper Res 33(6):1681\u20131694","journal-title":"Comput Oper Res"},{"issue":"2","key":"9502_CR15","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1287\/opre.1090.0717","volume":"58","author":"S Savasaneril","year":"2010","unstructured":"Savasaneril S, Griffin PM, Keskinocak P (2010) Dynamic lead-time quotation for an M\/M\/1 base-stock inventory queue. Oper Res 58(2):383\u2013395","journal-title":"Oper Res"},{"issue":"3","key":"9502_CR16","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1016\/j.ejor.2003.07.023","volume":"163","author":"SA Slotnick","year":"2005","unstructured":"Slotnick SA, Sobel MJ (2005) Manufacturing lead-time rule: customer retention versus tardiness costs. Eur J Oper Res 163(3):825\u2013856","journal-title":"Eur J Oper Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9502-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-012-9502-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9502-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:18Z","timestamp":1559262198000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-012-9502-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,18]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["9502"],"URL":"https:\/\/doi.org\/10.1007\/s10878-012-9502-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,18]]}}}