{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T01:57:13Z","timestamp":1648864633961},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,1,3]],"date-time":"2008-01-03T00:00:00Z","timestamp":1199318400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2008,8]]},"DOI":"10.1007\/s10878-007-9128-7","type":"journal-article","created":{"date-parts":[[2008,1,2]],"date-time":"2008-01-02T10:17:57Z","timestamp":1199269077000},"page":"119-126","source":"Crossref","is-referenced-by-count":2,"title":["An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan"],"prefix":"10.1007","volume":"16","author":[{"given":"Yuzhong","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhigang","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,1,3]]},"reference":[{"key":"9128_CR1","doi-asserted-by":"crossref","unstructured":"Azizoglu M, Webster S (2000) Scheduling a batch processing machine with non-identical job sizes. Int J Prod Res 38(10)","DOI":"10.1080\/00207540050028034"},{"key":"9128_CR2","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.0.CO;2-R","volume":"1","author":"P Brucker","year":"1998","unstructured":"Brucker P, Gladky A, Hoogeveen H, Kovalyow MY, Potts CN, Tautenhahn T, van de Velde SL (1998) Scheduling a bathing machine. J Sched 1:31\u201354","journal-title":"J Sched"},{"key":"9128_CR3","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1023\/A:1027316504440","volume":"7","author":"XT Deng","year":"2003","unstructured":"Deng XT, Poon CK, Zhang YZ (2003) Approximation algorithms in batch scheduling. J Comb Optim 7:247\u2013257","journal-title":"J Comb Optim"},{"issue":"4","key":"9128_CR4","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/s00453-003-1053-2","volume":"38","author":"XT Deng","year":"2004","unstructured":"Deng XT, Feng HD, Zhang PX, Zhang YZ, Zhu H (2004) Minimizing mean completion time in batch processing system. Algorithmica 38(4):513\u2013528","journal-title":"Algorithmica"},{"key":"9128_CR5","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1016\/S0305-0548(00)00078-2","volume":"29","author":"L Dupont","year":"2002","unstructured":"Dupont L, Dhaenens-Flipo C (2002) Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure. Comput Oper Res 29:807\u2013819","journal-title":"Comput Oper Res"},{"issue":"4","key":"9128_CR6","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF02579456","volume":"1","author":"W Fernandez de la Vega","year":"1981","unstructured":"Fernandez de la Vega W, Lueker GS (1981) Bin packing can be solved within in linear time. Combinatorica 1(4):349\u2013355","journal-title":"Combinatorica"},{"key":"9128_CR7","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling. Ann Discrete Math 5:287\u2013326","journal-title":"Ann Discrete Math"},{"key":"9128_CR8","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/S0925-5273(98)00067-X","volume":"55","author":"F Jolai Ghazvini","year":"1998","unstructured":"Jolai Ghazvini F, Dupont L (1998) Minimizing mean flow times criteria on a single batch processing machine with nonidentical job sizes. Int J Prod Econ 55:273\u2013280","journal-title":"Int J Prod Econ"},{"key":"9128_CR9","volume-title":"Scheduling theory and its applications","author":"JK Lenstra","year":"1995","unstructured":"Lenstra JK, Shmoys DR (1995) Computing near-optimal schedules. In: Ch\u00e9tienne P et al. (eds) Scheduling theory and its applications. Wiley, New York"},{"key":"9128_CR10","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/j.orl.2004.04.009","volume":"33","author":"SG Li","year":"2005","unstructured":"Li SG, Li GJ, Liu QM, Wang XL (2005) Minimizing makespan on a single batching machine with release times and non-identical jog sizes. Oper Res Lett 33:157\u2013164","journal-title":"Oper Res Lett"},{"key":"9128_CR11","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/S0377-2217(99)00153-8","volume":"120","author":"CN Potts","year":"2000","unstructured":"Potts CN, Lovalyov MY (2000) Scheduling with batching: a review. Eur J Oper Res 120:228\u2013249","journal-title":"Eur J Oper Res"},{"issue":"7","key":"9128_CR12","doi-asserted-by":"crossref","first-page":"1615","DOI":"10.1080\/00207549408957026","volume":"32","author":"R Uzsoy","year":"1994","unstructured":"Uzsoy R (1994) Scheduling a single batch processing machine with non-identical job sizes. Int J Prod Res 32(7):1615\u20131635","journal-title":"Int J Prod Res"},{"key":"9128_CR13","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1002\/nav.4","volume":"48","author":"GC Zhang","year":"2001","unstructured":"Zhang GC, Cai XQ, Lee CY, Wong CK (2001) Minimizing makespan on a single batch processing machine with non-identical job sizes. Nav Res Logist 48:226\u2013247","journal-title":"Nav Res Logist"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9128-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-007-9128-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9128-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:18:12Z","timestamp":1559261892000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-007-9128-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1,3]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["9128"],"URL":"https:\/\/doi.org\/10.1007\/s10878-007-9128-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,1,3]]}}}