{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T15:56:57Z","timestamp":1758124617124},"reference-count":16,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Asia Pac. J. Oper. Res."],"published-print":{"date-parts":[[2013,2]]},"abstract":"<jats:p> In this paper, we consider the scheduling problem in which the jobs are first processed on a single machine and then delivered in batches by a single vehicle with limited capacity to the respective customers located at the vertices of a star-shaped network. The goal is to minimize the makespan. We present a 3\/2-approximation algorithm for the identical job size case and a 2-approximation algorithm for the non-identical job sizes case. <\/jats:p>","DOI":"10.1142\/s0217595912500480","type":"journal-article","created":{"date-parts":[[2013,1,24]],"date-time":"2013-01-24T13:41:25Z","timestamp":1359034885000},"page":"1250048","source":"Crossref","is-referenced-by-count":2,"title":["SINGLE MACHINE SCHEDULING WITH BATCH DELIVERY TO MULTIPLE CUSTOMERS IN A STAR-SHAPED NETWORK"],"prefix":"10.1142","volume":"30","author":[{"given":"LEIYANG","family":"WANG","sequence":"first","affiliation":[{"name":"Department of Mathematics, East China University of Science and Technology, Shanghai 200237, P. R. China"}]},{"given":"ZHAOHUI","family":"LIU","sequence":"additional","affiliation":[{"name":"Department of Mathematics, East China University of Science and Technology, Shanghai 200237, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2013,2,17]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.40.4.750"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(03)00364-3"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.1040.0325"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(96)00127-0"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623494269540"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1060.0208"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-005-6234-8"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800010110"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1002\/1099-1425(200101\/02)4:1<3::AID-JOS57>3.0.CO;2-D"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2007.11.007"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2003.11.022"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1002\/1099-1425(200101\/02)4:1<25::AID-JOS58>3.0.CO;2-7"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.02.019"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2010.05.026"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1002\/nav.4"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.09.059"}],"container-title":["Asia-Pacific Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0217595912500480","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T17:19:23Z","timestamp":1565111963000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0217595912500480"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2]]},"references-count":16,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2013,2,17]]},"published-print":{"date-parts":[[2013,2]]}},"alternative-id":["10.1142\/S0217595912500480"],"URL":"https:\/\/doi.org\/10.1142\/s0217595912500480","relation":{},"ISSN":["0217-5959","1793-7019"],"issn-type":[{"value":"0217-5959","type":"print"},{"value":"1793-7019","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2]]}}}