{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T02:30:28Z","timestamp":1774492228012,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2010,5,7]],"date-time":"2010-05-07T00:00:00Z","timestamp":1273190400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2010,10]]},"DOI":"10.1007\/s10951-010-0176-y","type":"journal-article","created":{"date-parts":[[2010,5,6]],"date-time":"2010-05-06T21:45:32Z","timestamp":1273182332000},"page":"463-477","source":"Crossref","is-referenced-by-count":23,"title":["Parallel batch scheduling of equal-length jobs with release and\u00a0due dates"],"prefix":"10.1007","volume":"13","author":[{"given":"Alessandro","family":"Condotta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sigrid","family":"Knust","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Natalia V.","family":"Shakhlevich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,5,7]]},"reference":[{"key":"176_CR1","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s001860000088","volume":"52","author":"P. Baptiste","year":"2000","unstructured":"Baptiste, P. (2000). Batching identical jobs. Mathematical Methods of Operations Research, 52, 355\u2013367.","journal-title":"Mathematical Methods of Operations Research"},{"key":"176_CR2","volume-title":"Scheduling algorithms","author":"P. Brucker","year":"2007","unstructured":"Brucker, P. (2007). Scheduling algorithms. Berlin: Springer."},{"key":"176_CR3","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1016\/j.cor.2003.09.001","volume":"32","author":"T. C. E. Cheng","year":"2005","unstructured":"Cheng, T. C. E., Yuan, J. J., & Yang, A. F. (2005). Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times. Computers and Operations Research, 32, 849\u2013859.","journal-title":"Computers and Operations Research"},{"key":"176_CR4","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1137\/0210018","volume":"10","author":"M. R. Garey","year":"1981","unstructured":"Garey, M. R., Johnson, D. S., Simons, B. B., & Tarjan, R. E. (1981). Scheduling unit-time tasks with arbitrary release times and deadlines. SIAM Journal on Computing, 10, 256\u2013269.","journal-title":"SIAM Journal on Computing"},{"key":"176_CR5","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0167-6377(86)90104-5","volume":"5","author":"Y. Ikura","year":"1986","unstructured":"Ikura, Y., & Gimple, M. (1986). Efficient scheduling algorithms for a single batch processing machine. Operations Research Letters, 5, 61\u201365.","journal-title":"Operations Research Letters"},{"key":"176_CR6","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1111\/j.1467-9574.1976.tb00264.x","volume":"30","author":"B. J. Lageweg","year":"1976","unstructured":"Lageweg, B. J., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1976). Minimizing maximum lateness on one machine: computational experience and some applications. Statistica Neerlandica, 30, 25\u201341.","journal-title":"Statistica Neerlandica"},{"key":"176_CR7","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","volume-title":"Handbooks in operations research and management science, logistics of production and inventory","author":"E. L. Lawler","year":"1993","unstructured":"Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., & Shmoys, D. B. (1993). Sequencing and scheduling: algorithms and complexity. In Graves, S. C., Rinnooy Kan, A. H. G., & Zipkin, P. H. (Eds.) Handbooks in operations research and management science, logistics of production and inventory (Vol.\u00a04, pp.\u00a0445\u2013522). Amsterdam: North-Holland."},{"key":"176_CR8","doi-asserted-by":"crossref","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. (1992). Efficient algorithms for scheduling semiconductor burn-in operations. Operations Research, 40, 764\u2013775.","journal-title":"Operations Research"},{"key":"176_CR9","doi-asserted-by":"crossref","unstructured":"Simons, B. B. (1978). A fast algorithm for multiprocessor scheduling of unit-length jobs. In IEEE 19th annual symposium on foundations of computer science (pp. 246\u2013252).","DOI":"10.1109\/SFCS.1978.4"},{"key":"176_CR10","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1137\/0212018","volume":"12","author":"B. B. Simons","year":"1983","unstructured":"Simons, B. B. (1983). Multiprocessor scheduling of unit-time jobs with arbitrary release times and deadlines. SIAM Journal on Computing, 12, 294\u2013299.","journal-title":"SIAM Journal on Computing"},{"key":"176_CR11","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1137\/0218048","volume":"18","author":"B. B. Simons","year":"1989","unstructured":"Simons, B. B., & Warmuth, M. K. (1989). A fast algorithm for multiprocessor scheduling of unit-length jobs. SIAM Journal on Computing, 18, 690\u2013710.","journal-title":"SIAM Journal on Computing"},{"key":"176_CR12","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","volume":"10","author":"J. D. Ullman","year":"1975","unstructured":"Ullman, J. D. (1975). NP-complete scheduling problems. Journal of Computer and System Sciences, 10, 384\u2013393.","journal-title":"Journal of Computer and System Sciences"},{"key":"176_CR13","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/S0196-6774(03)00072-5","volume":"48","author":"N. Vakhania","year":"2003","unstructured":"Vakhania, N. (2003). A better algorithm for sequencing with release and delivery times on identical machines. Journal of Algorithms, 48, 273\u2013293.","journal-title":"Journal of Algorithms"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0176-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-010-0176-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0176-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:44Z","timestamp":1559468384000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-010-0176-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,7]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2010,10]]}},"alternative-id":["176"],"URL":"https:\/\/doi.org\/10.1007\/s10951-010-0176-y","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,7]]}}}