{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:34:51Z","timestamp":1759667691431},"reference-count":5,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2004,8]]},"abstract":"<jats:p> We study the scheduling problem on a batch machine which is capable of processing a batch of jobs at a time. For a batch machine of capacity c, we designed an algorithm for minimizing the total completion time in O(n<jats:sup>6c<\/jats:sup>) time (for sufficiently large c). This improves the best previous time bound of O(n<jats:sup>c(c-1)<\/jats:sup>) given by Brucker et al [1]. We also designed a new algorithm with running time [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s0129054104002637","type":"journal-article","created":{"date-parts":[[2004,8,30]],"date-time":"2004-08-30T11:36:17Z","timestamp":1093865777000},"page":"593-607","source":"Crossref","is-referenced-by-count":11,"title":["ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING"],"prefix":"10.1142","volume":"15","author":[{"given":"CHUNG KEUNG","family":"POON","sequence":"first","affiliation":[{"name":"Department of Computer Science,  City University of Hong Kong, 83 Tat Chee Avenue,  Koowloon Tong, Hong Kong, China"}]},{"given":"WENCI","family":"YU","sequence":"additional","affiliation":[{"name":"Institute of Applied Mathematics,  East China University of Science and Technology, 130, Meilong Road,  Shanghai 200237, China"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.0.CO;2-R"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(93)90030-K"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1080\/00207549308956847"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1287\/opre.45.6.874"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1287\/opre.40.4.764"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054104002637","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:39:44Z","timestamp":1565138384000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054104002637"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,8]]},"references-count":5,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2004,8]]}},"alternative-id":["10.1142\/S0129054104002637"],"URL":"https:\/\/doi.org\/10.1142\/s0129054104002637","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,8]]}}}