{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T19:23:56Z","timestamp":1775157836775,"version":"3.50.1"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,8,3]],"date-time":"2007-08-03T00:00:00Z","timestamp":1186099200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1007\/s10878-007-9095-z","type":"journal-article","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T00:20:56Z","timestamp":1186014056000},"page":"28-38","source":"Crossref","is-referenced-by-count":49,"title":["Online scheduling on parallel machines with two GoS levels"],"prefix":"10.1007","volume":"16","author":[{"given":"Yiwei","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,8,3]]},"reference":[{"key":"9095_CR1","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1006\/jagm.1995.1008","volume":"18","author":"Y Azar","year":"1995","unstructured":"Azar Y, Naor J, Rom R (1995) The competitiveness of on-line assignments. J Algorithms 18:221\u2013237","journal-title":"J Algorithms"},{"key":"9095_CR2","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1137\/S0097539798346135","volume":"31","author":"A Bar-Noy","year":"2001","unstructured":"Bar-Noy A, Freund A, Naor J (2001) On-line load balancing in a hierarchical server topology. SIAM J Comput 31:527\u2013549","journal-title":"SIAM J Comput"},{"issue":"3","key":"9095_CR3","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0166-218X(03)00341-X","volume":"137","author":"P Crescenzi","year":"2004","unstructured":"Crescenzi P, Gambosi G, Penna P (2004) On-line algorithms for the channel assignment problem in cellular networks. Discret Appl Math 137(3):237\u2013266","journal-title":"Discret Appl Math"},{"key":"9095_CR4","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 (2004) Parallel machine scheduling under a grade of service provision. Comput Oper Res 31:2055\u20132061","journal-title":"Comput Oper Res"},{"issue":"3","key":"9095_CR5","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1631\/jzus.2006.A0309","volume":"7","author":"YW Jiang","year":"2006","unstructured":"Jiang YW, He Y, Tang CM (2006) Optimal online algorithms for scheduling on two identical machines under a grade of service. J Zhejiang Univ Sci 7(3):309\u2013314","journal-title":"J Zhejiang Univ Sci"},{"key":"9095_CR6","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"JK Lenstra","year":"1990","unstructured":"Lenstra JK, Shmoys DB, Tardos NE (1990) Approximation algorithms for scheduling unrelated parallel machines. Math Program 46:259\u2013271","journal-title":"Math Program"},{"issue":"6","key":"9095_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 SY, Lee K (2006) Online and semi-online scheduling of two machines under a grade of service provision. Oper Res Lett 34(6):692\u2013696","journal-title":"Oper Res Lett"},{"issue":"3","key":"9095_CR8","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1142\/S0252959901000280","volume":"22","author":"P Zhou","year":"2007","unstructured":"Zhou P, Jiang YW, He Y (2007) Parallel machines scheduling with two GoS levels. Appl Math J Chin Univ Ser A 22(3):275\u2013284 (in Chinese)","journal-title":"Appl Math J Chin Univ Ser A"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9095-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-007-9095-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9095-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:18:12Z","timestamp":1559261892000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-007-9095-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8,3]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,7]]}},"alternative-id":["9095"],"URL":"https:\/\/doi.org\/10.1007\/s10878-007-9095-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,8,3]]}}}