{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T06:58:15Z","timestamp":1758265095770},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642401039"},{"type":"electronic","value":"9783642401046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40104-6_41","type":"book-chapter","created":{"date-parts":[[2013,7,11]],"date-time":"2013-07-11T01:36:30Z","timestamp":1373506590000},"page":"475-486","source":"Crossref","is-referenced-by-count":13,"title":["Optimal Batch Schedules for Parallel Machines"],"prefix":"10.1007","author":[{"given":"Frederic","family":"Koehler","sequence":"first","affiliation":[]},{"given":"Samir","family":"Khuller","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"41_CR1","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s001860000088","volume":"53","author":"P. Baptiste","year":"2000","unstructured":"Baptiste, P.: Batching identical jobs. Math. Meth. of O.R.\u00a053, 355\u2013367 (2000)","journal-title":"Math. Meth. of O.R."},{"key":"41_CR2","first-page":"742","volume-title":"Proc. of SODA","author":"A. Bar-Noy","year":"2002","unstructured":"Bar-Noy, A., Guha, S., Katz, Y., Naor, J.(S.), Schieber, B., Shachnai, H.: Throughput Maximization of Real-time Scheduling with Batching. In: Proc. of SODA, pp. 742\u2013751 (2002)"},{"key":"41_CR3","volume-title":"Scheduling Algorithms","author":"P. Brucker","year":"2007","unstructured":"Brucker, P.: Scheduling Algorithms. Springer (2007)"},{"key":"41_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-642-33090-2_26","volume-title":"Algorithms \u2013 ESA 2012","author":"J. Chang","year":"2012","unstructured":"Chang, J., Gabow, H.N., Khuller, S.: A model for minimizing active processor time. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol.\u00a07501, pp. 289\u2013300. Springer, Heidelberg (2012), full version at \n                  \n                    http:\/\/www.cs.umd.edu\/~samir\/grant\/active.pdf"},{"key":"41_CR5","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/s10951-010-0176-y","volume":"13","author":"A. Condotta","year":"2010","unstructured":"Condotta, A., Knust, S., Shakhlevich, N.V.: Parallel batch scheduling of equal-length jobs with release and due dates. J. of Scheduling\u00a013, 463\u2013477 (2010)","journal-title":"J. of Scheduling"},{"key":"41_CR6","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/s00453-009-9310-7","volume":"59","author":"C. D\u00fcrr","year":"2011","unstructured":"D\u00fcrr, C., Hurand, M.: Finding total unimodularity in optimization problems solved by linear programs. Algorithmica\u00a059, 256\u2013268 (2011)","journal-title":"Algorithmica"},{"issue":"2","key":"41_CR7","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1137\/0210018","volume":"10","author":"M.R. Garey","year":"1981","unstructured":"Garey, M.R., Johnson, D.S., Simons, B., Tarjan, R.E.: Scheduling Unit-Time Tasks with Arbitrary Release Times and Deadlines. SIAM J. on Computing\u00a010(2), 256\u2013269 (1981)","journal-title":"SIAM J. on Computing"},{"issue":"2","key":"41_CR8","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/0020-0190(81)90030-2","volume":"13","author":"R. Hood","year":"1981","unstructured":"Hood, R., Melville, R.: Real-time queue operation in pure lisp. Information Processing Letters\u00a013(2), 50\u201354 (1981)","journal-title":"Information Processing Letters"},{"key":"41_CR9","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0167-6377(86)90104-5","volume":"5","author":"Y. Ikura","year":"1986","unstructured":"Ikura, Y., Gimple, M.: Efficient scheduling algorithms for a single batch processing machine. Operations Research Letters\u00a05, 61\u201365 (1986)","journal-title":"Operations Research Letters"},{"issue":"4","key":"41_CR10","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1287\/opre.40.4.764","volume":"40","author":"C.-Y. Lee","year":"1992","unstructured":"Lee, C.-Y., Uzsoy, R., Martin-Vega, L.A.: Efficient algorithms for scheduling semiconductor burn-in operations. Op. Research\u00a040(4), 764\u2013775 (1992)","journal-title":"Op. Research"},{"issue":"3","key":"41_CR11","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1016\/0377-2217(95)00332-0","volume":"96","author":"C.-L. Li","year":"1997","unstructured":"Li, C.-L., Lee, C.-Y.: Scheduling with agreeable release times and due dates on a batch processing machine. European J. of Operational Research\u00a096(3), 564\u2013569 (1997)","journal-title":"European J. of Operational Research"},{"key":"41_CR12","first-page":"380","volume-title":"STACS","author":"A. L\u00f3pez-Ortiz","year":"2011","unstructured":"L\u00f3pez-Ortiz, A., Quimper, C.-G.: A fast algorithm for multi-machine scheduling problems with jobs of equal processing times. In: STACS, pp. 380\u2013391 (2011)"},{"issue":"04","key":"41_CR13","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1017\/S0956796800001489","volume":"5","author":"C. Okasaki","year":"1995","unstructured":"Okasaki, C.: Simple and efficient purely functional queues and deques. Journal of Functional Programming\u00a05(04), 583\u2013592 (1995)","journal-title":"Journal of Functional Programming"},{"issue":"2","key":"41_CR14","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1137\/0212018","volume":"12","author":"B. Simons","year":"1983","unstructured":"Simons, B.: Multiprocessor scheduling of unit-time jobs with arbitrary release times and deadlines. SIAM J. Comput.\u00a012(2), 294\u2013299 (1983)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40104-6_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T14:40:51Z","timestamp":1557931251000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40104-6_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401039","9783642401046"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40104-6_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}