{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T20:29:27Z","timestamp":1673209767581},"reference-count":14,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"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":[[1989,1]]},"DOI":"10.1016\/0305-0548(89)90029-4","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"409-417","source":"Crossref","is-referenced-by-count":11,"title":["Scheduling unit-time jobs on processors with different capabilities"],"prefix":"10.1016","volume":"16","author":[{"given":"Y.L.","family":"Chen","sequence":"first","affiliation":[]},{"given":"Y.H.","family":"Chin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(89)90029-4_BIB1","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1016\/0305-0548(88)90063-9","article-title":"On a scheduling problem where each job can be executed only by a limited number of processors","volume":"15","author":"Chang","year":"1988","journal-title":"Computers Opns Res."},{"key":"10.1016\/0305-0548(89)90029-4_BIB2","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling theory: a survey","volume":"5","author":"Graham","year":"1977","journal-title":"Discrete Math."},{"key":"10.1016\/0305-0548(89)90029-4_BIB3","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1145\/356698.356700","article-title":"Deterministic processor scheduling","volume":"9","author":"Gonzales","year":"1977","journal-title":"Compt. Survey"},{"key":"10.1016\/0305-0548(89)90029-4_BIB4","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0020-0190(87)90145-1","article-title":"Minimizing mean weighted execution time loss on identical and uniform processors","volume":"24","author":"Blazewicz","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0305-0548(89)90029-4_BIB5","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1145\/322276.322284","article-title":"Algorithms for scheduling tasks on unrelated processors","volume":"28","author":"Davis","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0305-0548(89)90029-4_BIB6","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0305-0548(82)90020-X","article-title":"Scheduling to minimize lateness on unequal parallel processors","volume":"9","author":"De","year":"1982","journal-title":"Computers Opns Res."},{"key":"10.1016\/0305-0548(89)90029-4_BIB7","unstructured":"T. Gonzalez, E. L. Lawler and S. Sahni, Optimal preemptive scheduling of two unrelated processors in linear time. J. ACM. In press."},{"key":"10.1016\/0305-0548(89)90029-4_BIB8","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/322092.322101","article-title":"On preemptive scheduling of unrelated parallel processors by linear programming","volume":"25","author":"Lawler","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/0305-0548(89)90029-4_BIB9","article-title":"Some optimization problems in scheduling file transfers","author":"Chen","year":"1989"},{"key":"10.1016\/0305-0548(89)90029-4_BIB10","first-page":"434","article-title":"Determining the maximal flow in a network by the method of preflows","volume":"15","author":"Karzanov","year":"1974","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0305-0548(89)90029-4_BIB11","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1137\/0216020","article-title":"Fast algorithms for bipartite network flow","volume":"16","author":"Gusfield","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0305-0548(89)90029-4_BIB12","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0020-0190(78)90016-9","article-title":"An O(\u00a6V\u00a63) algorithm for finding maximum flows in networks","volume":"7","author":"Malhotra","year":"1978","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0305-0548(89)90029-4_BIB13","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0305-0548(89)90029-4_BIB14","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1137\/0204043","article-title":"Network flow and testing graph connectivity","volume":"4","author":"Even","year":"1975","journal-title":"SIAM Comput."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054889900294?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054889900294?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T16:59:00Z","timestamp":1552928340000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054889900294"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,1]]},"references-count":14,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1989,1]]}},"alternative-id":["0305054889900294"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(89)90029-4","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1989,1]]}}}