{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:59:39Z","timestamp":1774418379961,"version":"3.50.1"},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,6,16]],"date-time":"2007-06-16T00:00:00Z","timestamp":1181952000000},"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,2]]},"DOI":"10.1007\/s10951-007-0022-z","type":"journal-article","created":{"date-parts":[[2007,6,16]],"date-time":"2007-06-16T10:59:08Z","timestamp":1181991548000},"page":"71-73","source":"Crossref","is-referenced-by-count":16,"title":["Minimizing the number of tardy jobs with\u00a0stochastically-ordered processing times"],"prefix":"10.1007","volume":"11","author":[{"given":"Dan","family":"Trietsch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenneth R.","family":"Baker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,6,16]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"van den Akker, J. M. Hoogeveen, J. A. (2007, to appear). Minimizing the number of late jobs in case of stochastic processing times with minimum success probabilities. Journal of Scheduling.","DOI":"10.1007\/s10951-007-0034-8"},{"key":"22_CR2","doi-asserted-by":"crossref","first-page":"1283","DOI":"10.1287\/mnsc.19.11.1283","volume":"19","author":"S. J. Balut","year":"1973","unstructured":"Balut, S. J. (1973). Scheduling to minimize the number of late jobs when set-up and processing times are uncertain. Management Science, 19, 1283\u20131288.","journal-title":"Management Science"},{"key":"22_CR3","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1287\/mnsc.29.3.384","volume":"29","author":"H. Kise","year":"1983","unstructured":"Kise, H., & Ibaraki, T. (1983). On Balut\u2019s algorithm and NP-completeness for a chance constrained scheduling problem. Management Science, 29, 384\u2013388.","journal-title":"Management Science"},{"key":"22_CR4","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1287\/mnsc.15.1.102","volume":"15","author":"J. M. Moore","year":"1968","unstructured":"Moore, J. M. (1968). An n Job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science, 15, 102\u2013109.","journal-title":"Management Science"},{"key":"22_CR5","volume-title":"Stochastic processes","author":"S. M. Ross","year":"1996","unstructured":"Ross, S. M. (1996). Stochastic processes (2nd ed.). New York: Wiley.","edition":"2"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-007-0022-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-007-0022-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-007-0022-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:39Z","timestamp":1559468379000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-007-0022-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,16]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,2]]}},"alternative-id":["22"],"URL":"https:\/\/doi.org\/10.1007\/s10951-007-0022-z","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,6,16]]}}}