{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T10:49:09Z","timestamp":1649069349460},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T00:00:00Z","timestamp":1291334400000},"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":[[2012,6]]},"DOI":"10.1007\/s10951-010-0210-0","type":"journal-article","created":{"date-parts":[[2010,12,2]],"date-time":"2010-12-02T14:30:56Z","timestamp":1291300256000},"page":"289-294","source":"Crossref","is-referenced-by-count":1,"title":["Optimality proof of the Kise\u2013Ibaraki\u2013Mine algorithm"],"prefix":"10.1007","volume":"15","author":[{"given":"Shanlin","family":"Li","sequence":"first","affiliation":[]},{"given":"Zhi-Long","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Guochun","family":"Tang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,12,3]]},"reference":[{"key":"210_CR1","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0167-6377(98)00045-5","volume":"24","author":"P. Baptiste","year":"1999","unstructured":"Baptiste, P. (1999). An O(n 4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Operations Research Letters, 24, 175\u2013180.","journal-title":"Operations Research Letters"},{"key":"210_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(01)00353-8","volume":"144","author":"P. Baptiste","year":"2003","unstructured":"Baptiste, P., Peridy, L., & Pinson, E. (2003). A branch and bound to minimize the number of late jobs on a single machine with release time constraints. European Journal of Operational Research, 144, 1\u201311.","journal-title":"European Journal of Operational Research"},{"key":"210_CR3","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1023\/B:JOSH.0000046073.05827.15","volume":"7","author":"A. Dauzere-Peres","year":"2004","unstructured":"Dauzere-Peres, A., & Sevaux, M. (2004). An exact method to minimize the number of tardy jobs in single machine scheduling. Journal of Scheduling, 7, 405\u2013420.","journal-title":"Journal of Scheduling"},{"key":"210_CR4","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1287\/opre.26.1.121","volume":"26","author":"H. Kise","year":"1978","unstructured":"Kise, H., Ibaraki, T., & Mine, H. (1978). A solvable case of the one-machine scheduling problem with ready and due times. Operations Research, 26, 121\u2013126.","journal-title":"Operations Research"},{"key":"210_CR5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF02248588","volume":"26","author":"E. L. Lawler","year":"1990","unstructured":"Lawler, E. L. (1990). A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Annals of Operations Research, 26, 125\u2013133.","journal-title":"Annals of Operations Research"},{"key":"210_CR6","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0895-7177(94)90209-7","volume":"20","author":"E. L. Lawler","year":"1994","unstructured":"Lawler, E. L. (1994). Knapsack-like scheduling problems, the Moore\u2013Hodgson algorithm and the \u201ctower of sets\u201d property. Mathematical and Computer Modelling, 20, 91\u2013106.","journal-title":"Mathematical and Computer Modelling"},{"key":"210_CR7","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":"210_CR8","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1287\/opre.1090.0749","volume":"58","author":"S. Li","year":"2010","unstructured":"Li, S., Chen, Z.-L., & Tang, G. (2010). A note on the optimality proof of the Kise\u2013Ibaraki\u2013Mine algorithm. Operations Research, 58, 508\u2013509.","journal-title":"Operations Research"},{"key":"210_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). An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science, 15, 102\u2013109.","journal-title":"Management Science"},{"key":"210_CR10","volume-title":"Scheduling theory, algorithms, and systems","author":"M. Pinedo","year":"2002","unstructured":"Pinedo, M. (2002). Scheduling theory, algorithms, and systems (2nd ed.). Upper Saddle River: Prentice Hall.","edition":"2"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0210-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-010-0210-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0210-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:45Z","timestamp":1559453985000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-010-0210-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,3]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["210"],"URL":"https:\/\/doi.org\/10.1007\/s10951-010-0210-0","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12,3]]}}}