{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T15:37:36Z","timestamp":1758123456392},"reference-count":15,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Asia Pac. J. Oper. Res."],"published-print":{"date-parts":[[2018,8]]},"abstract":"<jats:p> In this paper, we consider the online scheduling of incompatible family jobs with equal length on an unbounded parallel-batch machine with job delivery. The jobs arrive online over time and belong to [Formula: see text] incompatible job families, where [Formula: see text] is known in advance. The jobs are first processed in batches on an unbounded parallel-batch machine and then the completed jobs are delivered in batches by a vehicle with infinite capacity to their customers. The jobs from distinct families cannot be processed and delivered in the same batch. The objective is to minimize the maximum delivery completion time of the jobs. For this problem, we present an online algorithm with the best competitive ratio of [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s0217595918500264","type":"journal-article","created":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T08:50:55Z","timestamp":1528707055000},"page":"1850026","source":"Crossref","is-referenced-by-count":2,"title":["Online Scheduling of Incompatible Family Jobs with Equal Length on an Unbounded Parallel-Batch Machine with Job Delivery"],"prefix":"10.1142","volume":"35","author":[{"given":"Qijia","family":"Liu","sequence":"first","affiliation":[{"name":"School of Mathematics and Statistics, Zhengzhou University, Zhengzhou, Henan 450001, People\u2019s Republic of China"},{"name":"College of Information and Management Science, Henan Agricultural University, Zhengzhou, Henan 450003, People\u2019s Republic of China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinjiang","family":"Yuan","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Zhengzhou University, Zhengzhou, Henan 450001, People\u2019s Republic of China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2018,8,13]]},"reference":[{"key":"S0217595918500264BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/S0360-8352(01)00009-2"},{"key":"S0217595918500264BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2013.01.003"},{"key":"S0217595918500264BIB004","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480196296823"},{"key":"S0217595918500264BIB005","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-013-0650-5"},{"key":"S0217595918500264BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2012.03.015"},{"key":"S0217595918500264BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2004.04.001"},{"key":"S0217595918500264BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2007.01.007"},{"key":"S0217595918500264BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2006.12.061"},{"key":"S0217595918500264BIB010","volume-title":"Handbook of scheduling: Algorithms, Models and Performance Analysis","author":"Pruhs K","year":"2004"},{"key":"S0217595918500264BIB011","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793248317"},{"key":"S0217595918500264BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.12.002"},{"key":"S0217595918500264BIB013","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.12.001"},{"key":"S0217595918500264BIB014","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.08.003"},{"key":"S0217595918500264BIB015","doi-asserted-by":"publisher","DOI":"10.1007\/s40305-014-0060-0"},{"key":"S0217595918500264BIB016","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-007-9108-y"}],"container-title":["Asia-Pacific Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0217595918500264","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T17:38:09Z","timestamp":1565199489000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0217595918500264"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8]]},"references-count":15,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2018,8,13]]},"published-print":{"date-parts":[[2018,8]]}},"alternative-id":["10.1142\/S0217595918500264"],"URL":"https:\/\/doi.org\/10.1142\/s0217595918500264","relation":{},"ISSN":["0217-5959","1793-7019"],"issn-type":[{"value":"0217-5959","type":"print"},{"value":"1793-7019","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8]]}}}