{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T14:06:42Z","timestamp":1774534002159,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,1,26]],"date-time":"2008-01-26T00:00:00Z","timestamp":1201305600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2008,6]]},"DOI":"10.1007\/s10951-008-0053-0","type":"journal-article","created":{"date-parts":[[2008,1,25]],"date-time":"2008-01-25T17:02:43Z","timestamp":1201280563000},"page":"187-204","source":"Crossref","is-referenced-by-count":16,"title":["Effective on-line algorithms for reliable due date quotation and\u00a0large-scale scheduling"],"prefix":"10.1007","volume":"11","author":[{"given":"Philip","family":"Kaminsky","sequence":"first","affiliation":[]},{"given":"Zu-Hsu","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,1,26]]},"reference":[{"key":"53_CR1","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1080\/05695558108974544","volume":"13","author":"K. R. Baker","year":"1981","unstructured":"Baker, K. R., & Bertrand, J. W. M. (1981). A comparison of due-date selection rules. AIIE Transactions, 13, 123\u2013131.","journal-title":"AIIE Transactions"},{"key":"53_CR2","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1287\/mnsc.29.7.799","volume":"29","author":"J. W. M. Bertrand","year":"1983","unstructured":"Bertrand, J. W. M. (1983). The effect of workload dependent due-dates on job shop performance. Management Science, 29, 799\u2013816.","journal-title":"Management Science"},{"key":"53_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03612-9","volume-title":"Scheduling algorithms","author":"P. Brucker","year":"1998","unstructured":"Brucker, P. (1998). Scheduling algorithms. New York: Springer."},{"key":"53_CR4","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1287\/opre.40.3.596","volume":"40","author":"S. Chand","year":"1992","unstructured":"Chand, S., & Chhajed, D. (1992). A single machine model for determination of optimal due date and sequence. Operations Research, 40, 596\u2013602.","journal-title":"Operations Research"},{"issue":"4\u20135","key":"53_CR5","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, T.\u00a0W. (2005). Evolving fuzzy rules for due date assignment problem in semiconductor manufacturing factory. Journal of Intelligent Manufacturing, 16(4\u20135), 549.","journal-title":"Journal of Intelligent Manufacturing"},{"key":"53_CR6","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0377-2217(89)90100-8","volume":"38","author":"T. C. E. Cheng","year":"1989","unstructured":"Cheng, T. C. E., & Gupta, M. C. (1989). Survey of scheduling research involving due date determination decisions. European Journal of Operational Research, 38, 156\u2013166.","journal-title":"European Journal of Operational Research"},{"key":"53_CR7","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/978-94-009-7801-0_18","volume-title":"Deterministic and stochastic scheduling","author":"E. G. Coffman","year":"1982","unstructured":"Coffman, E. G., Frederickson, G. N., & Lueker, G. S. (1982). Probabilistic analysis of the LPT processor scheduling heuristic. In M.\u00a0A.\u00a0H. Dempster et al. (Eds.), Deterministic and stochastic scheduling (pp.\u00a0319\u2013331). Dordrecht: Reidel."},{"key":"53_CR8","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1287\/mnsc.41.4.608","volume":"41","author":"I. Duenyas","year":"1995","unstructured":"Duenyas, I. (1995). Single facility due date setting with multiple customer classes. Management Science, 41, 608\u2013619.","journal-title":"Management Science"},{"key":"53_CR9","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, W. J. (1995). Quoting customer lead times. Management Science, 41, 43\u201357.","journal-title":"Management Science"},{"key":"53_CR10","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1080\/00207547608956596","volume":"14","author":"S. Eilon","year":"1976","unstructured":"Eilon, S., & Chowdhury, I. G. (1976). Due dates in job shop scheduling. International Journal of Production Research, 14, 223\u2013237.","journal-title":"International Journal of Production Research"},{"key":"53_CR11","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1287\/moor.12.2.241","volume":"12","author":"J. B. G. Frenk","year":"1987","unstructured":"Frenk, J. B. G., & Rinnooy Kan, A. H. G. (1987). The asymptotic optimality of the LPT rule. Mathematics of Operations Research, 12, 241\u2013254.","journal-title":"Mathematics of Operations Research"},{"key":"53_CR12","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1287\/moor.10.2.328","volume":"10","author":"Gazmuri","year":"1985","unstructured":"Gazmuri (1985). Probabilistic analysis of a machine scheduling problem. Mathematics of Operations Research, 10, 328\u2013339.","journal-title":"Mathematics of Operations Research"},{"key":"53_CR13","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1287\/opre.39.5.836","volume":"39","author":"N. G. Hall","year":"1991","unstructured":"Hall, N. G., & Posner, M. E. (1991). Earliness-tardiness scheduling problems, I:\u00a0weighted deviation of completion times about a common due date. Operations Research, 39, 836\u2013846.","journal-title":"Operations Research"},{"issue":"9","key":"53_CR14","doi-asserted-by":"crossref","first-page":"1727","DOI":"10.1080\/00207540310001624375","volume":"42","author":"S. Y. Hsu","year":"2004","unstructured":"Hsu, S. Y., & Sha, D. Y. (2004). Due date assignment using artificial neural networks under different shop floor control strategies. International Journal of Production Research, 42(9), 1727\u20131745.","journal-title":"International Journal of Production Research"},{"key":"53_CR15","unstructured":"Kahlbacher, H. (1992). Termin-und Ablaufplanung\u2014ein analytischer Zugang. PhD thesis, University of Kaiserslautern, cited in [3]."},{"issue":"3","key":"53_CR16","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1002\/nav.10054","volume":"50","author":"P. Kaminsky","year":"2003","unstructured":"Kaminsky, P. (2003). The effectiveness of the longest delivery time rule for the flow shop delivery time problem. Naval Research Logistics, 50(3), 257\u2013272.","journal-title":"Naval Research Logistics"},{"key":"53_CR17","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 J. Y. Leung (Ed.), Handbook on scheduling algorithms, methods and models. London: Chapman Hall\/CRC."},{"key":"53_CR18","doi-asserted-by":"crossref","first-page":"872","DOI":"10.1287\/opre.46.6.872","volume":"46","author":"P. Kaminsky","year":"1998","unstructured":"Kaminsky, P., & Simchi-Levi, D. (1998). Probabilistic analysis and practical algorithms for the flow shop weighted completion time problem. Operations Research, 46, 872\u2013882.","journal-title":"Operations Research"},{"key":"53_CR19","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0167-6377(01)00099-2","volume":"29","author":"P. Kaminsky","year":"2001","unstructured":"Kaminsky, P., & Simchi-Levi, D. (2001). Probabilistic analysis of an on-line algorithm for the single machine completion time problem with release dates. Operations Research Letters, 29, 141\u2013148.","journal-title":"Operations Research Letters"},{"key":"53_CR20","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. Management Science, 47, 264\u2013279.","journal-title":"Management Science"},{"key":"53_CR21","unstructured":"Lee, Z. (2003). Design and analysis of algorithms for due date quotation. PhD dissertation, University of California, Berkeley."},{"key":"53_CR22","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"J. K. Lenstra","year":"1977","unstructured":"Lenstra, J. K., Rinnooy Kan, A. H. G., & Brucker, P. (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1, 343\u2013362.","journal-title":"Annals of Discrete Mathematics"},{"key":"53_CR23","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1002\/nav.20066","volume":"52","author":"H. Liu","year":"2005","unstructured":"Liu, H., Queyranne, M., & Simchi-Levi, D. (2005). On the asymptotic optimality of algorithms for the flow shop problem with release dates. Naval Research Logistics, 52, 232\u2013242.","journal-title":"Naval Research Logistics"},{"key":"53_CR24","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1287\/moor.9.1.142","volume":"9","author":"R. Loulou","year":"1984","unstructured":"Loulou, R. (1984). Tight bounds and probabilistic analysis of two heuristics for parallel processor scheduling. Mathematics of Operations Research, 9, 142\u2013150.","journal-title":"Mathematics of Operations Research"},{"key":"53_CR25","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1080\/00207548108956642","volume":"19","author":"S. Miyazaki","year":"1981","unstructured":"Miyazaki, S. (1981). Combined scheduling system for reducing job tardiness in a job shop. International Journal of Production Research, 19, 201\u2013211.","journal-title":"International Journal of Production Research"},{"key":"53_CR26","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/opre.30.2.391","volume":"30","author":"S. S. Panwalkar","year":"1982","unstructured":"Panwalkar, S. S., Smith, M. L., & Seidmann, A. (1982). Common due date assignment to minimize total penalty for the one machine scheduling problem. Operations Research, 30, 391\u2013399.","journal-title":"Operations Research"},{"issue":"6","key":"53_CR27","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. Computers & Operations Research, 33(6), 1681\u20131694.","journal-title":"Computers & Operations Research"},{"key":"53_CR28","doi-asserted-by":"crossref","first-page":"899","DOI":"10.1287\/opre.44.6.899","volume":"44","author":"A. Ramudhin","year":"1996","unstructured":"Ramudhin, A., Bartholdi, J. J., Calvin, J., Vande Vate, J. H., & Weiss, G. (1996). A probabilistic analysis of 2-machine flowshops. Operations Research, 44, 899\u2013908.","journal-title":"Operations Research"},{"key":"53_CR29","volume-title":"Stochastic processes","author":"S. M. Ross","year":"1996","unstructured":"Ross, S. M. (1996). Stochastic processes (2nd ed.). New York: Wiley.","edition":"2"},{"key":"53_CR30","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1080\/00207548108956667","volume":"19","author":"A. Seidmann","year":"1981","unstructured":"Seidmann, A., Panwalker, S. S., & Smith, M. L. (1981). Optimal assignment of due dates for a single processor scheduling problem. International Journal of Production Research, 19, 393\u2013399.","journal-title":"International Journal of Production Research"},{"issue":"3","key":"53_CR31","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1016\/j.ejor.2003.07.023","volume":"163","author":"S. A. Slotnick","year":"2005","unstructured":"Slotnick, S. A., & Sobel, M. J. (2005). Manufacturing lead-time rule: customer retention versus tardiness costs. European Journal of Operational Research, 163(3), 825\u2013856.","journal-title":"European Journal of Operational Research"},{"key":"53_CR32","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(92)90034-Z","volume":"11","author":"A. M. Spaccamela","year":"1992","unstructured":"Spaccamela, A. M., Rhee, W. S., Stougie, L., & van de Geer, S. (1992). Probabilistic analysis of the minimum weighted flowtime scheduling problem. Operations Research Letters, 11, 67\u201371.","journal-title":"Operations Research Letters"},{"key":"53_CR33","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1287\/mnsc.45.2.290","volume":"45","author":"M. Spearman","year":"1999","unstructured":"Spearman, M., & Zhang, R. Q. (1999). Optimal lead time policies. Management Science, 45, 290\u2013295.","journal-title":"Management Science"},{"key":"53_CR34","first-page":"186","volume":"41","author":"S. Webster","year":"1993","unstructured":"Webster, S. (1993). Bounds and asymptotic results for the uniform parallel processor weighted flow time problem. Operations Research Letters, 41, 186\u2013193.","journal-title":"Operations Research Letters"},{"key":"53_CR35","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/mnsc.25.4.363","volume":"25","author":"J. K. Weeks","year":"1979","unstructured":"Weeks, J. K. (1979). A\u00a0simulation study of predictable due-dates. Management Science, 25, 363\u2013373.","journal-title":"Management Science"},{"key":"53_CR36","doi-asserted-by":"crossref","first-page":"834","DOI":"10.1287\/mnsc.37.7.834","volume":"37","author":"L. M. Wein","year":"1991","unstructured":"Wein, L. M. (1991). Due-date setting and priority sequencing in a multiclass M\/G\/1 queue. Management Science, 37, 834\u2013850.","journal-title":"Management Science"},{"key":"53_CR37","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1287\/opre.48.4.615.12423","volume":"48","author":"C. Xia","year":"2000","unstructured":"Xia, C., Shanthikumar, G., & Glynn, P. (2000). On the asymptotic optimality of the SPT rule for the flow shop average completion time problem. Operations Research, 48, 615\u2013622.","journal-title":"Operations Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-008-0053-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-008-0053-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-008-0053-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:40Z","timestamp":1559468380000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-008-0053-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1,26]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,6]]}},"alternative-id":["53"],"URL":"https:\/\/doi.org\/10.1007\/s10951-008-0053-0","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,1,26]]}}}