{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T22:55:57Z","timestamp":1770504957728,"version":"3.49.0"},"reference-count":8,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[2004,10,1]],"date-time":"2004-10-01T00:00:00Z","timestamp":1096588800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2004,10]]},"DOI":"10.1016\/s0305-0548(03)00164-3","type":"journal-article","created":{"date-parts":[[2003,6,2]],"date-time":"2003-06-02T23:15:45Z","timestamp":1054595745000},"page":"2055-2061","source":"Crossref","is-referenced-by-count":97,"title":["Parallel machine scheduling under a grade of service provision"],"prefix":"10.1016","volume":"31","author":[{"given":"Hark-Chin","family":"Hwang","sequence":"first","affiliation":[]},{"given":"Soo Y.","family":"Chang","sequence":"additional","affiliation":[]},{"given":"Kangbok","family":"Lee","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(03)00164-3_BIB1","series-title":"Scheduling: theory, algorithms, and systems","author":"Pinedo","year":"1995"},{"key":"10.1016\/S0305-0548(03)00164-3_BIB2","series-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0305-0548(03)00164-3_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0207001","article-title":"An application of bin-packing to multiprocessor scheduling","volume":"7","author":"Coffman","year":"1978","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0305-0548(03)00164-3_BIB4","first-page":"416","article-title":"Bounds on multiprocessor timing anomalies","volume":"17","author":"Graham","year":"1969","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0305-0548(03)00164-3_BIB5","doi-asserted-by":"crossref","unstructured":"Yue M. On the exact upper bound for the MULTIFIT processor scheduling algorithm. In: Yue M, editor. Operations research in China. Annals of Operations Research 1990; 24: 233\u201359.","DOI":"10.1007\/BF02216826"},{"key":"10.1016\/S0305-0548(03)00164-3_BIB6","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1006\/jagm.1995.1008","article-title":"The competitiveness of on-line assignments","volume":"18","author":"Azar","year":"1995","journal-title":"Journal of Algorithms"},{"key":"10.1016\/S0305-0548(03)00164-3_BIB7","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF01585745","article-title":"Approximation algorithms for scheduling unrelated parallel machines","volume":"46","author":"Lenstra","year":"1990","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(03)00164-3_BIB8","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0166-218X(91)90013-M","article-title":"Parallel machine scheduling with nonsimultaneous machine available time","volume":"30","author":"Lee","year":"1991","journal-title":"Discrete Applied Mathematics"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803001643?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803001643?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T01:24:41Z","timestamp":1553131481000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054803001643"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,10]]},"references-count":8,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2004,10]]}},"alternative-id":["S0305054803001643"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(03)00164-3","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2004,10]]}}}