{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T08:02:52Z","timestamp":1767168172742,"version":"build-2238731810"},"reference-count":12,"publisher":"Wiley","license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Advances in Operations Research"],"published-print":{"date-parts":[[2011]]},"abstract":"<jats:p>We investigate complexity and approximation results on a processor networks where the communication delay depends on the distance between the processors performing tasks. We then prove that there is no heuristic with a performance guarantee smaller than 4\/3 for makespan minimization for precedence graph on a large class of processor networks like hypercube, grid, torus, and so forth, with a fixed diameter . We extend complexity results when the precedence graph is a bipartite graph. We also design an efficient polynomial-time -approximation algorithm for the makespan minimization on processor networks with diameter .<\/jats:p>","DOI":"10.1155\/2011\/476939","type":"journal-article","created":{"date-parts":[[2011,6,21]],"date-time":"2011-06-21T15:35:19Z","timestamp":1308670519000},"page":"1-20","source":"Crossref","is-referenced-by-count":1,"title":["Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks"],"prefix":"10.1155","volume":"2011","author":[{"given":"M.","family":"Bouznif","sequence":"first","affiliation":[{"name":"Laboratoire G-SCOP, 46 avenue F\u00e9lix Viallet, 38031 Grenoble Cedex 1, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7544-8542","authenticated-orcid":true,"given":"R.","family":"Giroudeau","sequence":"additional","affiliation":[{"name":"LIRMM, 161 rue Ada, UMR 5056, 34392 Montpellier Cedex 5, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70356-X"},{"issue":"1","key":"7","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10288-010-0127-7","volume":"9","year":"2011","journal-title":"4OR A Quarterly Journal of Operations Research"},{"key":"11","volume-title":"Scheduling with unit processing and communication times on a ring network: approximation results","year":"1996"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(87)90042-4"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1137\/0218016"},{"key":"5","series-title":"A Series of Books in the Mathematical Science","year":"1979"},{"key":"4","series-title":"Scheduling with Communication Delays: A Survey","year":"1995"},{"issue":"1","key":"13","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1287\/opre.45.1.145","volume":"45","year":"1997","journal-title":"Operations Research"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.03.027"},{"key":"3","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321812.321815","volume":"21","year":"1974","journal-title":"Journal of the Association for Computing Machinery"},{"key":"1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","year":"1958","journal-title":"Quarterly of Applied Mathematics"},{"key":"8","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","year":"1966","journal-title":"Bell System Technical Journal"}],"updated-by":[{"DOI":"10.1155\/2012\/543215","type":"erratum","label":"Erratum","source":"publisher","updated":{"date-parts":[[2012,5,28]],"date-time":"2012-05-28T00:00:00Z","timestamp":1338163200000}}],"container-title":["Advances in Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/aor\/2011\/476939.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/aor\/2011\/476939.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/aor\/2011\/476939.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T21:54:18Z","timestamp":1497909258000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.hindawi.com\/journals\/aor\/2011\/476939\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"references-count":12,"alternative-id":["476939","476939"],"URL":"https:\/\/doi.org\/10.1155\/2011\/476939","relation":{},"ISSN":["1687-9147","1687-9155"],"issn-type":[{"value":"1687-9147","type":"print"},{"value":"1687-9155","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}