{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:12:11Z","timestamp":1774415531494,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2002,4]]},"DOI":"10.1016\/s0167-6377(02)00110-4","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T19:55:37Z","timestamp":1034625337000},"page":"100-106","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":27,"title":["Minimizing the expected number of tardy jobs when processing times are normally distributed"],"prefix":"10.1016","volume":"30","author":[{"given":"Wooseung","family":"Jang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cerry M.","family":"Klein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(02)00110-4_BIB1","doi-asserted-by":"crossref","first-page":"1283","DOI":"10.1287\/mnsc.19.11.1283","article-title":"Scheduling to minimize the number of late jobs when set-up and processing times are uncertain","volume":"19","author":"Balut","year":"1973","journal-title":"Management Sci."},{"key":"10.1016\/S0167-6377(02)00110-4_BIB2","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0167-6377(97)00017-5","article-title":"Bounds on optimal values in stochastic scheduling","volume":"21","author":"Birge","year":"1997","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(02)00110-4_BIB3","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0167-6377(86)90084-2","article-title":"Minimizing the expected weighted number of tardy jobs in stochastic flow shops","volume":"5","author":"Boxma","year":"1986","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(02)00110-4_BIB4","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1002\/(SICI)1520-6750(199709)44:6<531::AID-NAV2>3.0.CO;2-4","article-title":"Scheduling stochastic jobs with asymmetric earliness and tardiness penalties","volume":"44","author":"Cai","year":"1997","journal-title":"Naval Res. Logist."},{"key":"10.1016\/S0167-6377(02)00110-4_BIB5","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1287\/moor.18.3.658","article-title":"Rearrangement, majorization and stochastic scheduling","volume":"18","author":"Chang","year":"1993","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0167-6377(02)00110-4_BIB6","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/0305-0548(91)90022-J","article-title":"On the minimization of the weighted number of tardy jobs with random processing times and deadline","volume":"18","author":"De","year":"1991","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0167-6377(02)00110-4_BIB7","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1287\/moor.15.3.483","article-title":"Minimizing total tardiness on one processor is NP-hard","volume":"3","author":"Du","year":"1990","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0167-6377(02)00110-4_BIB8","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/S0167-6377(02)00110-4_BIB9","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1287\/mnsc.29.3.384","article-title":"On Balut's algorithm and NP-completeness for a chance-constrained scheduling problem","volume":"29","author":"Kise","year":"1983","journal-title":"Management Sci."},{"key":"10.1016\/S0167-6377(02)00110-4_BIB10","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1287\/opre.31.3.559","article-title":"Stochastic scheduling with release dates and due dates","volume":"31","author":"Pinedo","year":"1983","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(02)00110-4_BIB11","series-title":"Scheduling: Theory, Algorithms, and Systems","author":"Pinedo","year":"1995"},{"key":"10.1016\/S0167-6377(02)00110-4_BIB12","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/0377-2217(91)90249-U","article-title":"Sequencing jobs on a single machine with a common due dates and stochastic processing times","volume":"51","author":"Sarin","year":"1991","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0167-6377(02)00110-4_BIB13","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0377-2217(94)90373-5","article-title":"The stochastic single machine scheduling problem with earliness and tardiness costs","volume":"54","author":"Soroush","year":"1994","journal-title":"European J. Oper. Res."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702001104?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702001104?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T22:33:39Z","timestamp":1759098819000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637702001104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["S0167637702001104"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(02)00110-4","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2002,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Minimizing the expected number of tardy jobs when processing times are normally distributed","name":"articletitle","label":"Article Title"},{"value":"Operations Research Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0167-6377(02)00110-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}