{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:45:43Z","timestamp":1720640743790},"reference-count":6,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2001,4,1]],"date-time":"2001-04-01T00:00:00Z","timestamp":986083200000},"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":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2001,4]]},"DOI":"10.1016\/s1571-0653(04)00251-3","type":"journal-article","created":{"date-parts":[[2005,4,9]],"date-time":"2005-04-09T09:34:04Z","timestamp":1113039244000},"page":"166-169","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["ILP Formulations for Scheduling Ordered Tasks on a Bounded Number of Processors"],"prefix":"10.1016","volume":"7","author":[{"given":"Manoel","family":"Camp\u00ealo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo","family":"Corr\u00eaa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nelson","family":"Maculan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F\u00e9bio","family":"Protti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S1571-0653(04)00251-3_BIB1","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1006\/jpdc.1995.1092","article-title":"Improved lower bounds on time and processors for scheduling precedence graphs on multicomputer systems","volume":"28","author":"Jain","year":"1995","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"4","key":"10.1016\/S1571-0653(04)00251-3_BIB2","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1145\/344588.344618","article-title":"Static scheduling algorithms for allocating directed task graphs to multiprocessors","volume":"31","author":"Kwok","year":"1999","journal-title":"ACM Computing Surveys"},{"issue":"1","key":"10.1016\/S1571-0653(04)00251-3_BIB3","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1287\/opre.45.1.145","article-title":"A heuristic for a scheduling problem with communication delays","volume":"45","author":"Munier","year":"1997","journal-title":"INFORMS Operations Research"},{"key":"10.1016\/S1571-0653(04)00251-3_BIB4","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/S1571-0653(04)00251-3_BIB5","series-title":"Handbook of Combinatorics","article-title":"Partially ordered sets","author":"Trotter","year":"1995"},{"key":"10.1016\/S1571-0653(04)00251-3_BIB6","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","article-title":"NP-Complete scheduling problems","volume":"10","author":"Ullman","year":"1975","journal-title":"J. Comput. Systems Sci."}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304002513?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304002513?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,27]],"date-time":"2019-01-27T08:50:30Z","timestamp":1548579030000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304002513"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,4]]},"references-count":6,"alternative-id":["S1571065304002513"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00251-3","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2001,4]]}}}