{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:45:41Z","timestamp":1720640741178},"reference-count":3,"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)00240-9","type":"journal-article","created":{"date-parts":[[2005,4,9]],"date-time":"2005-04-09T13:34:04Z","timestamp":1113053644000},"page":"122-125","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Exact Algorithms for the Imbalanced Time Minimizing Assignment Problem"],"prefix":"10.1016","volume":"7","author":[{"given":"Felipe Martins","family":"M\u00fcller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mauro Marafiga","family":"Camozzato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olinto","family":"C\u00e9sar Bassi de Ara\u00fajo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(04)00240-9_BIB1","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1016\/S0377-2217(97)00266-X","article-title":"A variant of time minimizing assignment problem","author":"Arora","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S1571-0653(04)00240-9_BIB2","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1145\/321941.321951","article-title":"Exact and Approximate Algorithms for Scheduling Nonidentical Processors","author":"Horowitz","year":"1976","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/S1571-0653(04)00240-9_BIB3","author":"Lawler","year":"1989","journal-title":"Sequencing and scheduling: algorithms and complexity, (Center for Mathematics and Computer Science, Report BS-R8909, Amsterdam"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304002409?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304002409?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,27]],"date-time":"2019-01-27T13:50:34Z","timestamp":1548597034000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304002409"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,4]]},"references-count":3,"alternative-id":["S1571065304002409"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00240-9","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2001,4]]}}}