{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,3]],"date-time":"2024-04-03T07:04:08Z","timestamp":1712127848627},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,11,29]],"date-time":"2014-11-29T00:00:00Z","timestamp":1417219200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s11590-014-0838-3","type":"journal-article","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T09:14:09Z","timestamp":1417425249000},"page":"207-213","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Optimal algorithm for semi-online scheduling on two machines under GoS levels"],"prefix":"10.1007","volume":"10","author":[{"given":"Taibo","family":"Luo","sequence":"first","affiliation":[]},{"given":"Yinfeng","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,29]]},"reference":[{"key":"838_CR1","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.ipl.2012.12.007","volume":"113","author":"X Chen","year":"2013","unstructured":"Chen, X., Xu, Z., D\u00f3sa, G., Han, X., Jiang, H.: Semi-online hierarchical scheduling problems with buffer or rearrangements. Inf. Process. Lett. 113, 127\u2013131 (2013)","journal-title":"Inf. Process. Lett."},{"key":"838_CR2","doi-asserted-by":"crossref","first-page":"2055","DOI":"10.1016\/S0305-0548(03)00164-3","volume":"31","author":"H Hwang","year":"2004","unstructured":"Hwang, H., Chang, S., Lee, K.: Parallel machine scheduling under a grade of service provision. Comput. Oper. Res. 31, 2055\u20132061 (2004)","journal-title":"Comput. Oper. Res."},{"key":"838_CR3","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1631\/jzus.2006.A0309","volume":"7","author":"Y Jiang","year":"2006","unstructured":"Jiang, Y., He, Y., Tang, C.: Optimal online algorithms for scheduling on two identical machines under a grade of service. J. Zhejiang Univ. Sci. A 7, 309\u2013314 (2006)","journal-title":"J. Zhejiang Univ. Sci. A"},{"key":"838_CR4","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.ipl.2008.04.021","volume":"108","author":"M Ji","year":"2008","unstructured":"Ji, M., Cheng, T.C.E.: An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan. Inf. Process. Lett. 108, 171\u2013174 (2008)","journal-title":"Inf. Process. Lett."},{"key":"838_CR5","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/s10878-009-9231-z","volume":"21","author":"M Liu","year":"2011","unstructured":"Liu, M., Chu, C., Xu, Y., Zheng, F.: Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times. J. Combin. Optim. 21, 138\u2013149 (2011)","journal-title":"J. Combin. Optim."},{"key":"838_CR6","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.tcs.2013.11.026","volume":"521","author":"T Luo","year":"2014","unstructured":"Luo, T., Xu, Y., Luo, L., He, C.: Semi-online scheduling with two GoS levels and unit processing time. Theor. Comput. Sci. 521, 62\u201372 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"838_CR7","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1016\/j.orl.2005.11.004","volume":"34","author":"J Park","year":"2006","unstructured":"Park, J., Chang, S.K., Lee, K.: Online and semi-online scheduling of two machines under a grade of service provision. Oper. Res. Lett. 34, 692\u2013696 (2006)","journal-title":"Oper. Res. Lett."},{"key":"838_CR8","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/j.ipl.2008.11.008","volume":"109","author":"GJ Woeginger","year":"2009","unstructured":"Woeginger, G.J.: A comment on parallel-machine scheduling under a grade of service provision to minimize makespan. Inf. Process. Lett. 109, 341\u2013342 (2009)","journal-title":"Inf. Process. Lett."},{"key":"838_CR9","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/j.ijpe.2011.07.021","volume":"135","author":"Y Wu","year":"2012","unstructured":"Wu, Y., Ji, M., Yang, Q.: Optimal semi-online scheduling algorithms on two parallel identical machines under a grade of service provision. Int. J. Prod. Econ. 135, 367\u2013371 (2012)","journal-title":"Int. J. Prod. Econ."},{"key":"838_CR10","doi-asserted-by":"crossref","unstructured":"Zhang, A., Jiang, Y., Fan, L., Hu, J.: Optimal online algorithms on two hierarchical machines with tighly-grouped processing times. J. Combin. Optim. (2013). doi: 10.1007\/s10878-013-9627-7","DOI":"10.1007\/s10878-013-9627-7"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0838-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-014-0838-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0838-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T13:11:41Z","timestamp":1559394701000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-014-0838-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,29]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["838"],"URL":"https:\/\/doi.org\/10.1007\/s11590-014-0838-3","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,29]]}}}