{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:41:05Z","timestamp":1775068865312,"version":"3.50.1"},"reference-count":11,"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":[[2016,8]]},"abstract":"<jats:p> We consider the problem of online scheduling a single machine with family setups under job availability. A setup must be scheduled when the next job comes from a different family from the last completed one, if any. The aim is to minimize the total completion time of all jobs. For the special case of identical processing times, we provide a lower bound for the competitive ratio and an online algorithm with its competitive analysis. <\/jats:p>","DOI":"10.1142\/s0217595916500275","type":"journal-article","created":{"date-parts":[[2016,7,18]],"date-time":"2016-07-18T09:37:43Z","timestamp":1468834663000},"page":"1650027","source":"Crossref","is-referenced-by-count":3,"title":["Online Machine Scheduling with Family Setups"],"prefix":"10.1142","volume":"33","author":[{"given":"Lele","family":"Zhang","sequence":"first","affiliation":[{"name":"Department of Mechanical Engineering, The University of Melbourne, VIC 3010, Australia"}]},{"given":"Andrew","family":"Wirth","sequence":"additional","affiliation":[{"name":"Department of Mechanical Engineering, The University of Melbourne, VIC 3010, Australia"}]}],"member":"219","published-online":{"date-parts":[[2016,8,5]]},"reference":[{"key":"S0217595916500275BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0483(98)00042-5"},{"key":"S0217595916500275BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.06.060"},{"key":"S0217595916500275BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.08.010"},{"key":"S0217595916500275BIB004","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1099-1425(200001\/02)3:1<51::AID-JOS34>3.0.CO;2-K"},{"key":"S0217595916500275BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(88)90252-4"},{"key":"S0217595916500275BIB007","volume-title":"Machine Scheduling Problems Classification, complexity and computations","author":"Kan AHGR","year":"1976"},{"key":"S0217595916500275BIB008","doi-asserted-by":"publisher","DOI":"10.1002\/1520-6750(199106)38:3<333::AID-NAV3220380305>3.0.CO;2-0"},{"key":"S0217595916500275BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00153-8"},{"key":"S0217595916500275BIB010","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1996.15"},{"key":"S0217595916500275BIB011","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-006-8776-2"},{"key":"S0217595916500275BIB012","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-009-9211-3"}],"container-title":["Asia-Pacific Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0217595916500275","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T18:23:46Z","timestamp":1565115826000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0217595916500275"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8]]},"references-count":11,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2016,8,5]]},"published-print":{"date-parts":[[2016,8]]}},"alternative-id":["10.1142\/S0217595916500275"],"URL":"https:\/\/doi.org\/10.1142\/s0217595916500275","relation":{},"ISSN":["0217-5959","1793-7019"],"issn-type":[{"value":"0217-5959","type":"print"},{"value":"1793-7019","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8]]}}}