{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T21:34:44Z","timestamp":1725658484968},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642247279"},{"type":"electronic","value":"9783642247286"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24728-6_82","type":"book-chapter","created":{"date-parts":[[2012,2,9]],"date-time":"2012-02-09T21:52:40Z","timestamp":1328824360000},"page":"612-618","source":"Crossref","is-referenced-by-count":0,"title":["An Improved Approximation Algorithm for a Class of Batch Scheduling Problems"],"prefix":"10.1007","author":[{"given":"Jianwei","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baowei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zengyu","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhaoyang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"82_CR1","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. Bruker","year":"1998","unstructured":"Bruker, P., Gladky, A., Hoogeveen, H., Kovalyov, M.Y., Tautenhahn, T.: Scheduling Batching Machine. Journal of Sheduling\u00a01, 31\u201354 (1998)","journal-title":"Journal of Sheduling"},{"issue":"4","key":"82_CR2","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1287\/opre.40.4.750","volume":"39","author":"H. Ahmadi","year":"1992","unstructured":"Ahmadi, H., Ahmadi, R.H., Dasu, S., Tang, C.S.: Batching and Scheduling Job Shop on Batch and Discrete Processors. Operations Research\u00a039(4), 750\u2013763 (1992)","journal-title":"Operations Research"},{"key":"82_CR3","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0166-218X(93)90085-3","volume":"47","author":"Albers","year":"1993","unstructured":"Albers, Brucker, P.: The Complexity of One-machine Batching Problem. Discrete Applied Mathematics\u00a047, 87\u2013107 (1993)","journal-title":"Discrete Applied Mathematics"},{"key":"82_CR4","doi-asserted-by":"publisher","first-page":"2097","DOI":"10.1080\/00207549308956847","volume":"31","author":"V. Chandru","year":"1993","unstructured":"Chandru, V., Lee, C.Y., Uzsoy, R.: Minimizing Total Completion Time on a Batch Processing Machine. International Journal of Production Research\u00a031, 2097\u20132121 (1993)","journal-title":"International Journal of Production Research"},{"key":"82_CR5","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0167-6377(93)90030-K","volume":"13","author":"V. Chandru","year":"1993","unstructured":"Chandru, V., Lee, C.Y., Uzsoy, R.: Minimizing Total Completion Time on a Batch Processing Machine with Job Families. Operations Research Letters\u00a013, 61\u201365 (1993)","journal-title":"Operations Research Letters"},{"key":"82_CR6","doi-asserted-by":"crossref","unstructured":"Poon, C.K., Yu, W.C.: On Minimizing Total Completion Time in Batch Machine Scheduling. International Journal of Foundations of Computer Science\u00a015(4) (2004)","DOI":"10.1142\/S0129054104002637"},{"issue":"6","key":"82_CR7","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1287\/opre.45.6.874","volume":"45","author":"D.S. Hochbaum","year":"1997","unstructured":"Hochbaum, D.S., Landy, D.: Scheduling Semiconductor Burn-in Operations to Minimize Total Flowtime. Operations Research\u00a045(6), 874\u2013885 (1997)","journal-title":"Operations Research"},{"key":"82_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/3-540-48686-0_23","volume-title":"Computing and Combinatorics","author":"X. Deng","year":"1999","unstructured":"Deng, X., Zhang, Y.: Minimizing Mean Response Time in Batch Processing System. In: Asano, T., Imai, H., Lee, D.T., Nakano, S.-i., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol.\u00a01627, pp. 231\u2013240. Springer, Heidelberg (1999)"},{"issue":"2","key":"82_CR9","first-page":"81","volume":"9","author":"C.X. Miao","year":"2005","unstructured":"Miao, C.X., Zhang, Y.Z.: Minimizing the Total Weighted Completed Time on Batch Processing Machines. Or Transactions\u00a09(2), 81\u201386 (2005)","journal-title":"Or Transactions"}],"container-title":["Lecture Notes in Computer Science","Advanced Intelligent Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24728-6_82","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T08:45:23Z","timestamp":1556354723000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24728-6_82"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642247279","9783642247286"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24728-6_82","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}