{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:10:22Z","timestamp":1759666222113},"reference-count":15,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2006,12]]},"abstract":"<jats:p> We study the problem of scheduling n jobs with release dates on m identical parallel batch machines to minimize the total weighted completion time of the jobs. A batch machine with capacity B (B &lt; n) is able to process a batch of up to B jobs simultaneously and the time needed is equal to the maximum processing time among the jobs in the batch. This model is motivated by applications in the manufacturing of integrated circuits. In this paper, we present a polynomial time approximation scheme (PTAS) for this problem. <\/jats:p>","DOI":"10.1142\/s0129054106004509","type":"journal-article","created":{"date-parts":[[2006,12,13]],"date-time":"2006-12-13T12:02:04Z","timestamp":1166011324000},"page":"1441-1453","source":"Crossref","is-referenced-by-count":10,"title":["MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES"],"prefix":"10.1142","volume":"17","author":[{"given":"SHUGUANG","family":"LI","sequence":"first","affiliation":[{"name":"School of Mathematics and System Sciences, Shandong University, Jinan 250100, People's Republic of China"},{"name":"Department of Mathematics and Information Science, Yantai University, Yantai, 264005, People's Republic of China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"GUOJUN","family":"LI","sequence":"additional","affiliation":[{"name":"School of Mathematics and System Sciences, Shandong University, Jinan 250100, People's Republic of China"},{"name":"Institute of Software, Chinese Academy of Sciences, Beijing 100080, People's Republic of China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"XINGQIN","family":"QI","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics, Shandong University at Weihai, Weihai, 264213, People's Republic of China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.0.CO;2-R"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1080\/00207549308956847"},{"key":"rf5","volume-title":"Handbook of Scheduling: Algorithms, Models, and Performance Analysis","author":"Chekuri C.","year":"2004"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOCO.0000021939.01674.1f"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-005-5480-7"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1287\/opre.45.6.874"},{"key":"rf11","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler E. L.","year":"1976"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1287\/opre.40.4.764"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70743-X"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2004.11.004"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2004.04.009"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00153-8"},{"key":"rf18","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054104002637"},{"key":"rf19","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800030106"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054106004509","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T15:27:43Z","timestamp":1565191663000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054106004509"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12]]},"references-count":15,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2006,12]]}},"alternative-id":["10.1142\/S0129054106004509"],"URL":"https:\/\/doi.org\/10.1142\/s0129054106004509","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12]]}}}