{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,10,26]],"date-time":"2022-10-26T15:30:52Z","timestamp":1666798252517},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2011,7,28]],"date-time":"2011-07-28T00:00:00Z","timestamp":1311811200000},"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":[[2012,12]]},"DOI":"10.1007\/s11590-011-0373-4","type":"journal-article","created":{"date-parts":[[2011,7,27]],"date-time":"2011-07-27T04:06:30Z","timestamp":1311739590000},"page":"1951-1955","source":"Crossref","is-referenced-by-count":1,"title":["A revised proof of the optimality for the Kise\u2013Ibaraki\u2013Mine algorithm"],"prefix":"10.1007","volume":"6","author":[{"given":"Baoqiang","family":"Fan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yeping","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rongjun","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guochun","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,7,28]]},"reference":[{"key":"373_CR1","volume-title":"Scheduling Algorithms (Fifth Edition)","author":"P. Brucker","year":"2006","unstructured":"Brucker P.: Scheduling Algorithms (Fifth Edition). Springer-Verlag, Berlin, Heidelberg (2006)"},{"key":"373_CR2","unstructured":"Brucker, P., Knust, S.: Complexity results for scheduling problems. http:\/\/www.mathematik.uni-osnabrueck.de\/research\/OR\/class (2010)"},{"key":"373_CR3","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":"373_CR4","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1287\/opre.1090.0749","volume":"58","author":"S.-L. Li","year":"2010","unstructured":"Li S.-L., Chen Z.-L., Tang G.-C.: A note on the optimality proof of the Kise\u2013Ibaraki\u2013Mine algorithm. Oper. Res. 58, 508\u2013509 (2010)","journal-title":"Oper. Res."},{"key":"373_CR5","volume-title":"Complexity in Numerical Optimization","year":"1993","unstructured":"Pardalos, P.M. (eds): Complexity in Numerical Optimization. World Scientific, Singapore (1993)"},{"key":"373_CR6","volume-title":"Handbook of Applied Optimization","year":"2002","unstructured":"Pardalos, P.M., Resende, M.G.C. (eds): Handbook of Applied Optimization. Oxford University Press, New York (2002)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-011-0373-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-011-0373-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-011-0373-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T13:11:29Z","timestamp":1559394689000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-011-0373-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,28]]},"references-count":6,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["373"],"URL":"https:\/\/doi.org\/10.1007\/s11590-011-0373-4","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7,28]]}}}