{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,25]],"date-time":"2024-06-25T09:14:44Z","timestamp":1719306884319},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,3,1]],"date-time":"2006-03-01T00:00:00Z","timestamp":1141171200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Jrl Syst Sci & Complex"],"published-print":{"date-parts":[[2006,3]]},"DOI":"10.1007\/s11424-006-0101-9","type":"journal-article","created":{"date-parts":[[2006,4,4]],"date-time":"2006-04-04T02:04:54Z","timestamp":1144116294000},"page":"101-107","source":"Crossref","is-referenced-by-count":3,"title":["Semi On-Line Scheduling Problem for Maximizing the Minimum Machine Completion Time on Two Uniform Machines"],"prefix":"10.1007","volume":"19","author":[{"given":"Runzi","family":"Luo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shijie","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenping","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"101_CR1","volume-title":"Computers and Intractability","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson, Computers and Intractability, W. H. Freeman and Company, San Francisco, 1979."},{"key":"101_CR2","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0167-6377(96)00055-7","volume":"20","author":"G. Woeginger","year":"1997","unstructured":"G. Woeginger, A polynomial time approximation scheme for minimizing the minimum machine completion time, Oper. Res. Letters, 1997, 20: 149\u2013154.","journal-title":"Oper. Res. Letters"},{"key":"101_CR3","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1137\/0603019","volume":"3","author":"B. L. Deuermeryer","year":"1982","unstructured":"B. L. Deuermeryer, D. K. Friesen and M. A. Langston, Scheduling to maximize the minimum processor finish time in a mutiprocessor system, SIAM J. Algorithms Discrete Methods, 1982, 3: 190\u2013196.","journal-title":"SIAM J. Algorithms Discrete Methods"},{"key":"101_CR4","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0167-6377(92)90004-M","volume":"11","author":"J. Csirik","year":"1992","unstructured":"J. Csirik, H. Kellerer and G. Woeginger, The exact LPT-bound for maximizing the minimum completion time, Oper. Res. Letters, 1992, 11: 281\u2013287.","journal-title":"Oper. Res. Letters"},{"key":"101_CR5","doi-asserted-by":"crossref","unstructured":"Y. Azar and L. Epstein, On-line machine covering, Algorithms-ESA'97, Lecture Notes in Computer Science 1284, Springer Verlag, 1997, 23\u201336.","DOI":"10.1007\/3-540-63397-9_3"},{"key":"101_CR6","first-page":"31","volume":"20","author":"Y. He","year":"2003","unstructured":"Y. He and Z. Y. Tan, Randomized on-line and semi-on-line scheduling on identical machines, Asia-Pacific Journal of Operational Research, 2003, 20: 31\u201340.","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"101_CR7","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1023\/A:1013855712183","volume":"6","author":"Y. He","year":"2002","unstructured":"Y. He and Z. Y. Tan, Ordinal on-line scheduling for maximizing the minimum machine completion time, Journal of Combinatorial Optimization, 2002, 6: 199\u2013206.","journal-title":"Journal of Combinatorial Optimization"},{"key":"101_CR8","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s006070050020","volume":"62","author":"Y. He","year":"1999","unstructured":"Y. He and G. C. Zhang, Semi on-line scheduling on two identical machines, Computing, 1999, 62: 179\u2013187.","journal-title":"Computing"},{"key":"101_CR9","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF02669690","volume":"17","author":"Y. He","year":"2001","unstructured":"Y. He, Semi on-line scheduling problem for maximizing the minimum machine completion time, Acta Mathematica Applicate Sinica, 2001, 17: 107\u2013113.","journal-title":"Acta Mathematica Applicate Sinica"},{"key":"101_CR10","unstructured":"L. Epstein, Tight bounds for bandwidth allocation on two links, Proc. of the 3rd ARACNE, 2002, 39\u201350."}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-006-0101-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11424-006-0101-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-006-0101-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T14:53:54Z","timestamp":1559400834000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11424-006-0101-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,3]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,3]]}},"alternative-id":["101"],"URL":"https:\/\/doi.org\/10.1007\/s11424-006-0101-9","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,3]]}}}