{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T16:39:06Z","timestamp":1740155946587,"version":"3.37.3"},"reference-count":11,"publisher":"Wiley","license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["10971234"],"award-info":[{"award-number":["10971234"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Advances in Operations Research"],"published-print":{"date-parts":[[2012]]},"abstract":"<jats:p>We mainly study the problem of scheduling<jats:italic>n<\/jats:italic>groups of jobs on<jats:italic>n<\/jats:italic>special-purpose processors and<jats:italic>m<\/jats:italic>general-purpose processors at different speeds provided that the setup time of each job is less than times of its processing time. We first propose an improved LS algorithm. Then, by applying this new algorithm, we obtain two bounds for the ratio of the approximate solution to the optimal solution<jats:italic>T<\/jats:italic>* under two different conditions.<\/jats:p>","DOI":"10.1155\/2012\/748597","type":"journal-article","created":{"date-parts":[[2012,9,6]],"date-time":"2012-09-06T17:28:01Z","timestamp":1346952481000},"page":"1-9","source":"Crossref","is-referenced-by-count":0,"title":["The Problem of Scheduling Multiple Groups of Jobs on Multiple Processors at Different Speeds"],"prefix":"10.1155","volume":"2012","author":[{"given":"Wei","family":"Ding","sequence":"first","affiliation":[{"name":"Department of Mathematics, Sun Yat-Sen University, Guangzhou 510275, China"}]}],"member":"311","reference":[{"key":"11","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1099-1425(199909\/10)2:5&lt;203::AID-JOS26&gt;3.3.CO;2-X"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1137\/0117039"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(93)90089-Y"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-003-0011-9"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.02.056"},{"issue":"4","key":"1","first-page":"122","volume":"10","year":"2006","journal-title":"OR Transactions"},{"issue":"3","key":"2","first-page":"19","volume":"47","year":"2008","journal-title":"Acta Scientiarum Naturalium Universitatis Sunyatseni"},{"issue":"2","key":"3","first-page":"26","volume":"23","year":"2009","journal-title":"Communication on Applied Mathematics and Computation"},{"issue":"1","key":"4","first-page":"5","volume":"49","year":"2010","journal-title":"Acta Scientiarum Naturalium Universitatis Sunyatseni. Zhongshan Daxue Xuebao. Ziran Kexue Ban"},{"issue":"1","key":"5","first-page":"34","volume":"5","year":"2010","journal-title":"Algorithmic Operations Research"},{"issue":"3","key":"6","first-page":"551","volume":"7","year":"2011","journal-title":"Pacific Journal of Optimization"}],"container-title":["Advances in Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/aor\/2012\/748597.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/aor\/2012\/748597.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/aor\/2012\/748597.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2016,8,3]],"date-time":"2016-08-03T03:59:24Z","timestamp":1470196764000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.hindawi.com\/journals\/aor\/2012\/748597\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"references-count":11,"alternative-id":["748597","748597"],"URL":"https:\/\/doi.org\/10.1155\/2012\/748597","relation":{},"ISSN":["1687-9147","1687-9155"],"issn-type":[{"type":"print","value":"1687-9147"},{"type":"electronic","value":"1687-9155"}],"subject":[],"published":{"date-parts":[[2012]]}}}