{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T21:18:16Z","timestamp":1649193496225},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2012,4,29]],"date-time":"2012-04-29T00:00:00Z","timestamp":1335657600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s11590-012-0480-x","type":"journal-article","created":{"date-parts":[[2012,4,28]],"date-time":"2012-04-28T06:50:53Z","timestamp":1335595853000},"page":"1017-1026","source":"Crossref","is-referenced-by-count":0,"title":["Tower-of-sets analysis for the Kise\u2013Ibaraki\u2013Mine algorithm"],"prefix":"10.1007","volume":"7","author":[{"given":"Maoqin","family":"Li","sequence":"first","affiliation":[]},{"given":"Shanlin","family":"Li","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Yan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,4,29]]},"reference":[{"key":"480_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.: An O(n 4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Oper. Res. Lett. 24, 175\u2013180 (1999)","journal-title":"Oper. Res. Lett."},{"key":"480_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.: A branch and bound to minimize the number of late jobs on a single machine with release time constraints. Eur. J. Oper. Res. 144, 1\u201311 (2003)","journal-title":"Eur. J. Oper. Res."},{"key":"480_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.: An exact method to minimize the number of tardy jobs in single machine scheduling. J. Sched. 7, 405\u2013420 (2004)","journal-title":"J. Sched."},{"key":"480_CR4","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.: Computers and Intractability, a Guide to the Theory of NP-Completeness. W.H. Freeman Company, San Francisco (1979)"},{"key":"480_CR5","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1023\/A:1011449311477","volume":"5","author":"S.H. Hwang","year":"2001","unstructured":"Hwang S.H., Cheng S.T.: Combinatorial optimization in real-time scheduling: theory and algorithms. J. Comb. Optim. 5, 345\u2013375 (2001)","journal-title":"J. Comb. Optim."},{"key":"480_CR6","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.: A solvable case of the one-machine scheduling problem with ready and due times. Oper. Res. 26, 121\u2013126 (1978)","journal-title":"Oper. Res."},{"key":"480_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.: Complexity of machine scheduling problems. Ann. Discrete Math. 1, 343\u2013362 (1977)","journal-title":"Ann. Discrete Math."},{"key":"480_CR8","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF02248588","volume":"26","author":"E.L. Lawler","year":"1990","unstructured":"Lawler E.L.: A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Ann. Oper. Res. 26, 125\u2013133 (1990)","journal-title":"Ann. Oper. Res."},{"key":"480_CR9","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.: Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the \u201ctower of sets\u201d property. Math. Comput. Model. 20, 91\u2013106 (1994)","journal-title":"Math. Comput. Model."},{"key":"480_CR10","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.: A note on the optimality proof of the Kise\u2013Ibaraki\u2013Mine algorithm. Oper. Res. 58, 508\u2013509 (2010a)","journal-title":"Oper. Res."},{"key":"480_CR11","doi-asserted-by":"crossref","unstructured":"Li, S., Chen, Z.L., Tang, G.: Optimality proof of the Kise-Ibaraki-Mine algorithm. J. Sched. (2010b, to appear)","DOI":"10.1007\/s10951-010-0210-0"},{"key":"480_CR12","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.: An n job, one machine sequencing algorithm for minimizing the number of late jobs. Manage. Sci. 15, 102\u2013109 (1968)","journal-title":"Manage. Sci."},{"key":"480_CR13","volume-title":"Scheduling Theory, Algorithms, and Systems","author":"M. Pinedo","year":"2002","unstructured":"Pinedo M.: Scheduling Theory, Algorithms, and Systems, 2nd edn. Prentice Hall, Upper Saddle River, New Jersey (2002)","edition":"2"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0480-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-012-0480-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0480-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T01:44:53Z","timestamp":1561686293000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-012-0480-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,29]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["480"],"URL":"https:\/\/doi.org\/10.1007\/s11590-012-0480-x","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,29]]}}}