{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T03:41:00Z","timestamp":1649130060923},"reference-count":7,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2012,12]]},"abstract":"<jats:p> This paper deals with semi-online scheduling on m-batch-machine flow shop. The objective is to minimize the makespan. A parallel batch processing machine can handle up to B jobs simultaneously. We study an unbounded model where B = \u221e. The jobs that are processed together construct a batch, and all jobs in a batch start and complete at the same time. The processing time of a batch is given by the longest processing time of any job in the batch. The problem is online in the sense that jobs arrive over time. Let p<jats:sub>i, j<\/jats:sub>(i = 1,\u2026,m) denote the processing time of job J<jats:sub>j<\/jats:sub> on machines M<jats:sub>i<\/jats:sub>, respectively. Let J<jats:sub>j+1<\/jats:sub> be the following job of J<jats:sub>j<\/jats:sub> in a job instance. We study semi-online problem with jobs' nondecreasing processing times. We focus on the case where p<jats:sub>1, j<\/jats:sub> = \u22ef = p<jats:sub>m, j<\/jats:sub> for i = 1, \u2026, m and p<jats:sub>i, j+1<\/jats:sub> \u2265 \u03b2p<jats:sub>i, j<\/jats:sub> (\u03b2 \u2265 1). For this problem, we propose an optimal algorithm [Formula: see text] with a competitive ratio [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s1793830912500516","type":"journal-article","created":{"date-parts":[[2012,9,25]],"date-time":"2012-09-25T19:17:45Z","timestamp":1348600665000},"page":"1250051","source":"Crossref","is-referenced-by-count":1,"title":["OPTIMAL SEMI-ONLINE ALGORITHMS FOR m-BATCH-MACHINE FLOW SHOP SCHEDULING"],"prefix":"10.1142","volume":"04","author":[{"given":"MING","family":"LIU","sequence":"first","affiliation":[{"name":"School of Economics &amp; Management, Tongji University, Shanghai, 200092, P. R. China"},{"name":"School of Management, Xi'an Jiaotong University, Xi'an, Shaanxi Province, 710049, P. R. China"}]},{"given":"CHENGBIN","family":"CHU","sequence":"additional","affiliation":[{"name":"School of Economics &amp; Management, Tongji University, Shanghai, 200092, P. R. China"},{"name":"Laboratoire G\u00e9nie Industriel, Ecole Centrale Paris, Grande Voie des Vignes, 92295 Ch\u00e2tenay-Malabry Cedex, France"}]}],"member":"219","published-online":{"date-parts":[[2013,1,4]]},"reference":[{"key":"rf1","volume-title":"Online Computation and Competitive Analysis","author":"Borodin A.","year":"1998"},{"key":"rf2","volume-title":"Scheduling Algorithms","author":"Brucker P.","year":"2007"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00268-7"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1080\/002075499192020"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1287\/opre.40.4.764"},{"key":"rf6","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"Pinedo M.","year":"2002"},{"key":"rf7","volume-title":"Handbook of Scheduling: Algorithms, Models, and Performance Analysis","author":"Pruhs K.","year":"2004"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830912500516","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T21:14:21Z","timestamp":1565126061000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830912500516"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12]]},"references-count":7,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2013,1,4]]},"published-print":{"date-parts":[[2012,12]]}},"alternative-id":["10.1142\/S1793830912500516"],"URL":"https:\/\/doi.org\/10.1142\/s1793830912500516","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12]]}}}