{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:59:25Z","timestamp":1725893965004},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540735557"},{"type":"electronic","value":"9783540735564"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73556-4_7","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T15:55:47Z","timestamp":1188316547000},"page":"44-51","source":"Crossref","is-referenced-by-count":1,"title":["An Asymptotic PTAS for Batch Scheduling with Nonidentical Job Sizes to Minimize Makespan"],"prefix":"10.1007","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","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Azizoglu, M., Webster, S.: Scheduling a batch processing machine with non-identical job sizes. International Journal of Production Research\u00a038(10) (2000)","DOI":"10.1080\/00207540050028034"},{"key":"7_CR2","doi-asserted-by":"publisher","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, M.Y., Potts, C.N., Tautenhahn, T., van de Velde, S.L.: Scheduling a batching machine. Journal of Scheduling\u00a01, 31\u201354 (1998)","journal-title":"Journal of Scheduling"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1016\/S0305-0548(00)00078-2","volume":"29","author":"L. Dupont","year":"2002","unstructured":"Dupont, L., Dhaenens-Flipo, C.: Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure. Computer & Operations Research\u00a029, 807\u2013819 (2002)","journal-title":"Computer & Operations Research"},{"issue":"4","key":"7_CR4","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/s00453-003-1053-2","volume":"38","author":"X.T. Deng","year":"2004","unstructured":"Deng, X.T., Feng, H.D., Zhang, P.X., Zhang, Y.Z., Zhu, H.: Minimizing mean completion time in batch processing system. Algorithmica\u00a038(4), 513\u2013528 (2004)","journal-title":"Algorithmica"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1023\/A:1027316504440","volume":"7","author":"X.T. Deng","year":"2003","unstructured":"Deng, X.T., Poon, C.K., Zhang, Y.Z.: Approximation Algorithms in batch scheduling. Journal of Combinational Optimization\u00a07, 247\u2013257 (2003)","journal-title":"Journal of Combinational Optimization"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R.L. Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling. Annals of Discrete Mathematics\u00a05, 287\u2013326 (1979)","journal-title":"Annals of Discrete Mathematics"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S0925-5273(98)00067-X","volume":"55","author":"F. Jolai","year":"1998","unstructured":"Jolai, F., Ghazvini, Pupont, L.: Minimizing mean flow times criteria on a single batch processing machine with nonidentical job sizes. International Journal of Production Econonmics\u00a055, 273\u2013280 (1998)","journal-title":"International Journal of Production Econonmics"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.orl.2004.04.009","volume":"33","author":"S.G. Li","year":"2005","unstructured":"Li, S.G., Li, G.J., Wang, X.L., Liu, Q.M.: Minimizing makespan on a single batching machine with release times and non-identical jog sizes. Operations Research Letters\u00a033, 157\u2013164 (2005)","journal-title":"Operations Research Letters"},{"key":"7_CR9","volume-title":"Scheduling theory and its applications","author":"J.K. Lenstra","year":"1995","unstructured":"Lenstra, J.K., Shmoys, D.R.: Computing near-optimal schedules. In: Ch\u00e9tienne, P., et al. (eds.) Scheduling theory and its applications, Wiley, New York (1995)"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/S0377-2217(99)00153-8","volume":"120","author":"C.N. Potts","year":"2000","unstructured":"Potts, C.N., Lovalyov, M.Y.: Scheduling with batching: a review. European Journal of Operational Research\u00a0120, 228\u2013249 (2000)","journal-title":"European Journal of Operational Research"},{"issue":"7","key":"7_CR11","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1080\/00207549408957026","volume":"32","author":"R. Uzsoy","year":"1994","unstructured":"Uzsoy, R.: Scheduling a single batch processing machine with non-identical job sizes. International Journal of Production Research\u00a032(7), 1615\u20131635 (1994)","journal-title":"International Journal of Production Research"},{"issue":"4","key":"7_CR12","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF02579456","volume":"1","author":"W.F. Vega de la","year":"1981","unstructured":"de la Vega, W.F., Lueker, G.S.: Bin packing can be solved within in linear time. Combinatorica\u00a01(4), 349\u2013355 (1981)","journal-title":"Combinatorica"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1002\/nav.4","volume":"48","author":"G.C. Zhang","year":"2001","unstructured":"Zhang, G.C., Cai, X.Q., Lee, C.Y., Wong, C.K.: Minimizing makespan on a single batch processing machine with non-identical job sizes. Naval Research Logistics\u00a048, 226\u2013247 (2001)","journal-title":"Naval Research Logistics"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73556-4_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T09:51:47Z","timestamp":1619517107000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73556-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735557","9783540735564"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73556-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}