乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T20:14:38Z","timestamp":1648584878551},"reference-count":15,"publisher":"Elsevier BV","issue":"5-6","license":[{"start":{"date-parts":[[1999,12,1]],"date-time":"1999-12-01T00:00:00Z","timestamp":944006400000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1999,12]]},"DOI":"10.1016\/s0020-0190(99)00151-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:07:29Z","timestamp":1027609649000},"page":"183-188","source":"Crossref","is-referenced-by-count":1,"title":["An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems"],"prefix":"10.1016","volume":"72","author":[{"given":"Ramesh","family":"Krishnamurti","sequence":"first","affiliation":[]},{"given":"Daya Ram","family":"Gaur","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/S0020-0190(99)00151-9_ID003","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1109\/TC.1986.1676781","article-title":"Scheduling multiprocessor tasks to minimize schedule length","volume":"C-35","author":"Bl\u0335a\u017cewicz","year":"1986","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0020-0190(99)00151-9_ID004","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0020-0190(88)90209-8","article-title":"Preemptive scheduling of independent tasks on hypercubes","volume":"28","author":"Chen","year":"1988","journal-title":"Inform. Process. Lett."},{"issue":"4","key":"10.1016\/S0020-0190(99)00151-9_ID005","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1137\/0402042","article-title":"Complexity of scheduling parallel task systems","volume":"2","author":"Du","year":"1989","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0020-0190(99)00151-9_ID006","series-title":"Solving Problems on Concurrent Processors, Vol. 1","author":"Fox","year":"1988"},{"key":"10.1016\/S0020-0190(99)00151-9_ID007","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1137\/0204035","article-title":"Complexity results for multiprocessor scheduling under resource constraints","volume":"4","author":"Garey","year":"1975","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/S0020-0190(99)00151-9_ID008","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1145\/321978.321985","article-title":"Open shop scheduling to minimize finish time","volume":"23","author":"Gonzalez","year":"1976","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/S0020-0190(99)00151-9_ID009","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1145\/322047.322055","article-title":"Preemptive scheduling of uniform processor systems","volume":"25","author":"Gonzalez","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(99)00151-9_ID010","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0166-218X(94)90012-4","article-title":"Complexity of scheduling multiprocessor jobs with prespecified processor allocations","volume":"55","author":"Hoogeveen","year":"1994","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/S0020-0190(99)00151-9_ID011","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1145\/321992.321995","article-title":"A level algorithm for preemptive scheduling","volume":"24","author":"Horvath","year":"1977","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(99)00151-9_ID012","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0020-0190(92)90172-R","article-title":"Scheduling multiprocessor tasks on three dedicated processors","volume":"41","author":"Bl\u0335a\u017cewicz","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(99)00151-9_ID013","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0304-3975(96)00282-4","article-title":"An approximation scheme for scheduling independent jobs into subcubes of a hypercube of fixed dimension","volume":"178","author":"Kopidakis","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(99)00151-9_ID014","unstructured":"R. Krishnamurti, D. Gaur, Preemptive scheduling on parallel task systems: Exact and approximation algorithms, submitted"},{"issue":"4","key":"10.1016\/S0020-0190(99)00151-9_ID015","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1137\/S0895480191221829","article-title":"An approximation algorithm for preemptive scheduling on parallel task systems","volume":"8","author":"Krishnamurti","year":"1995","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0020-0190(99)00151-9_ID016","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","article-title":"Sequencing with deadlines and loss functions","volume":"6","author":"McNaughton","year":"1959","journal-title":"Management Sci."},{"issue":"4","key":"10.1016\/S0020-0190(99)00151-9_ID017","doi-asserted-by":"crossref","DOI":"10.1287\/opre.44.4.617","article-title":"Scheduling jobs on several machines with the job splitting property","volume":"44","author":"Serafini","year":"1996","journal-title":"Oper. Res."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019099001519?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019099001519?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T14:55:37Z","timestamp":1556376937000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019099001519"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,12]]},"references-count":15,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[1999,12]]}},"alternative-id":["S0020019099001519"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(99)00151-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1999,12]]}}}