{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T05:08:24Z","timestamp":1768280904706,"version":"3.49.0"},"reference-count":10,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[1991,1]]},"DOI":"10.1016\/0305-0548(91)90022-j","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"457-463","source":"Crossref","is-referenced-by-count":27,"title":["On the minimization of the weighted number of tardy jobs with random processing times and deadline"],"prefix":"10.1016","volume":"18","author":[{"given":"Prabuddha","family":"De","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jay B.","family":"Ghosh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charles E.","family":"Wells","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(91)90022-J_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":"Mgmt Sci."},{"key":"10.1016\/0305-0548(91)90022-J_BIB2","series-title":"Statistical Theory of Reliability and Life Testing","author":"Barlow","year":"1975"},{"key":"10.1016\/0305-0548(91)90022-J_BIB3","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/mnsc.20.1.101","article-title":"N-Job, one machine sequencing problems under uncertainty","volume":"20","author":"Blau","year":"1973","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(91)90022-J_BIB4","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":"Ops Res. Lett."},{"key":"10.1016\/0305-0548(91)90022-J_BIB5","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1287\/mnsc.24.5.554","article-title":"A renewal decision problem","volume":"24","author":"Derman","year":"1978","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(91)90022-J_BIB6","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0305-0548(91)90022-J_BIB7","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":"Mgmt Sci."},{"key":"10.1016\/0305-0548(91)90022-J_BIB8","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":"Ops Res."},{"key":"10.1016\/0305-0548(91)90022-J_BIB9","series-title":"Presented at the 1989 ORSA\/TIMS Joint National Meeting","article-title":"Sequencing to stochastically maximize the number of successful job completions","author":"Righter","year":"1989"},{"key":"10.1016\/0305-0548(91)90022-J_BIB10","series-title":"Presented at the 1990 TIMS\/ORSA Joint National Meeting","article-title":"Sequencing jobs on a single machine with a common due date and stochastic processing times","author":"Sarin","year":"1990"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489190022J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489190022J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T17:21:38Z","timestamp":1552929698000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030505489190022J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":10,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["030505489190022J"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(91)90022-j","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}