{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:18:28Z","timestamp":1761895108346},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,6,24]],"date-time":"2010-06-24T00:00:00Z","timestamp":1277337600000},"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":[[2011,8]]},"DOI":"10.1007\/s10951-010-0183-z","type":"journal-article","created":{"date-parts":[[2010,6,23]],"date-time":"2010-06-23T17:17:41Z","timestamp":1277313461000},"page":"351-360","source":"Crossref","is-referenced-by-count":27,"title":["Minimizing the number of late jobs on a single machine under due date uncertainty"],"prefix":"10.1007","volume":"14","author":[{"given":"Hassene","family":"Aissi","sequence":"first","affiliation":[]},{"given":"Mohamed Ali","family":"Aloulou","sequence":"additional","affiliation":[]},{"given":"Mikhail Y.","family":"Kovalyov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,6,24]]},"reference":[{"key":"183_CR1","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1287\/opre.1030.0092","volume":"52","author":"A. Agnetis","year":"2004","unstructured":"Agnetis,\u00a0A., Mirchandani, P. B., Pacciarelli,\u00a0D., & Pacifici,\u00a0A. (2004). Scheduling problems with two competing agents. Operations Research, 52, 229\u2013242.","journal-title":"Operations Research"},{"key":"183_CR2","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1016\/j.orl.2004.12.002","volume":"33","author":"H. Aissi","year":"2005","unstructured":"Aissi,\u00a0H., Bazgan,\u00a0C., & Vanderpooten,\u00a0D. (2005). Complexity of the min-max and min-max regret assignment problem. Operations Research Letters, 33, 634\u2013640.","journal-title":"Operations Research Letters"},{"key":"183_CR3","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1016\/j.orl.2007.11.005","volume":"36","author":"M. A. Aloulou","year":"2008","unstructured":"Aloulou, M. A., & Della-Croce,\u00a0F. (2008). Complexity of one machine scheduling problems under scenario-based uncertainty. Operations Research Letters, 36, 338\u2013342.","journal-title":"Operations Research Letters"},{"key":"183_CR4","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.tcs.2006.07.011","volume":"362","author":"T. C. E. Cheng","year":"2006","unstructured":"Cheng, T. C. E., Ng, C. T., & Yuan, J. J. (2006). Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs. Theoretical Computer Science, 362, 273\u2013281.","journal-title":"Theoretical Computer Science"},{"key":"183_CR5","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.orl.2005.04.003","volume":"34","author":"V. Deineko","year":"2006","unstructured":"Deineko,\u00a0V., & Woeginger, G. J. (2006). On the robust assignment problem under a fixed number of cost scenarios. Operations Research Letters, 34, 175\u2013179.","journal-title":"Operations Research Letters"},{"key":"183_CR6","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: Freeman."},{"key":"183_CR7","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1007\/BF01068796","volume":"23","author":"A. V. Karzanov","year":"1987","unstructured":"Karzanov, A. V. (1987). Maximum matching of given weight in complete and complete bipartite graphs. Cybernetics, 23, 8\u201313 Translation from Kibernetika, 1, 7\u201311 (1987) (in Russian).","journal-title":"Cybernetics"},{"key":"183_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2620-6","volume-title":"Robust discrete optimization and its applications","author":"P. Kouvelis","year":"1997","unstructured":"Kouvelis,\u00a0P., & Yu,\u00a0G. (1997). Robust discrete optimization and its applications. Dordrecht: Kluwer Academic."},{"key":"183_CR9","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). A n job, one machine scheduling algorithm for minimizing the number of late jobs. Management Science, 15, 102\u2013109.","journal-title":"Management Science"},{"key":"183_CR10","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02579206","volume":"7","author":"K. Mulmuley","year":"1987","unstructured":"Mulmuley,\u00a0K., Vazirani, U. V., & Vazirani, V. V. (1987). Matching is as easy as matrix inversion. Combinatorica, 7, 105\u2013103.","journal-title":"Combinatorica"},{"key":"183_CR11","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1145\/322307.322309","volume":"29","author":"C. H. Papadimitriou","year":"1982","unstructured":"Papadimitriou, C. H., & Yannakakis,\u00a0M. (1982). The complexity of restricted spanning tree problems. Journal of the ACM, 29, 285\u2013309.","journal-title":"Journal of the ACM"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0183-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-010-0183-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0183-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:44Z","timestamp":1559468384000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-010-0183-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,24]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["183"],"URL":"https:\/\/doi.org\/10.1007\/s10951-010-0183-z","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,6,24]]}}}