{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T10:24:17Z","timestamp":1778581457537,"version":"3.51.4"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,12,24]],"date-time":"2009-12-24T00:00:00Z","timestamp":1261612800000},"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":[[2011,8]]},"DOI":"10.1007\/s10951-009-0150-8","type":"journal-article","created":{"date-parts":[[2009,12,23]],"date-time":"2009-12-23T15:41:03Z","timestamp":1261582863000},"page":"371-389","source":"Crossref","is-referenced-by-count":3,"title":["A polynomial-time algorithm for a flow-shop batching problem with\u00a0equal-length operations"],"prefix":"10.1007","volume":"14","author":[{"given":"Peter","family":"Brucker","sequence":"first","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":[[2009,12,24]]},"reference":[{"key":"150_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24804-0","volume-title":"Scheduling algorithms","author":"P. Brucker","year":"2004","unstructured":"Brucker, P. (2004). Scheduling algorithms. Berlin: Springer."},{"key":"150_CR2","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1002\/(SICI)1520-6750(200003)47:2<128::AID-NAV4>3.0.CO;2-#","volume":"47","author":"T. C. E. Cheng","year":"2000","unstructured":"Cheng, T. C. E., Lin, B. M. T., & Toker, A. (2000). Makespan minimization in the two-machine flow-shop batch scheduling problem. Naval Research Logistics, 47, 128\u2013144.","journal-title":"Naval Research Logistics"},{"key":"150_CR3","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/j.ejor.2003.09.010","volume":"161","author":"G. Mosheiov","year":"2005","unstructured":"Mosheiov, G., & Oron, D. (2005). A note on flow-shop and job-shop batch scheduling with identical processing time jobs. European Journal of Operational Research, 161, 285\u2013291.","journal-title":"European Journal of Operational Research"},{"key":"150_CR4","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.ipl.2005.12.003","volume":"98","author":"G. Mosheiov","year":"2006","unstructured":"Mosheiov, G., & Oron, D. (2006). Single machine scheduling with batch-dependent setup times. Information Processing Letters, 98, 73\u201378.","journal-title":"Information Processing Letters"},{"key":"150_CR5","doi-asserted-by":"crossref","first-page":"1282","DOI":"10.1016\/j.ejor.2006.03.068","volume":"187","author":"G. Mosheiov","year":"2008","unstructured":"Mosheiov, G., & Oron, D. (2008). Open-shop batch scheduling with identical jobs. European Journal of Operational Research, 187, 1282\u20131292.","journal-title":"European Journal of Operational Research"},{"key":"150_CR6","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1002\/nav.20028","volume":"51","author":"G. Mosheiov","year":"2004","unstructured":"Mosheiov, G., Oron, D., & Ritov, Y. (2004). Flow-shop batch scheduling with identical processing time jobs. Naval Research Logistics, 51, 783\u2013799.","journal-title":"Naval Research Logistics"},{"key":"150_CR7","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1016\/j.orl.2004.09.007","volume":"33","author":"G. Mosheiov","year":"2005","unstructured":"Mosheiov, G., Oron, D., & Ritov, Y. (2005). Minimizing flow-time on a single machine with integer batch sizes. Operations Research Letters, 33, 497\u2013501.","journal-title":"Operations Research Letters"},{"key":"150_CR8","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0166-218X(88)90049-2","volume":"21","author":"D. Naddeff","year":"1988","unstructured":"Naddeff, D., & Santos, C. (1988). One-pass batching algorithms for the one-machine batching problem. Discrete Applied Mathematics, 21, 133\u2013145.","journal-title":"Discrete Applied Mathematics"},{"key":"150_CR9","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s10951-007-0041-9","volume":"10","author":"C. T. Ng","year":"2007","unstructured":"Ng, C. T., & Kovalyov, M. Y. (2007). Batching and scheduling in a multi-machine flow shop. Journal of Scheduling, 10, 353\u2013364.","journal-title":"Journal of Scheduling"},{"key":"150_CR10","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0167-6377(85)90011-2","volume":"4","author":"C. Santos","year":"1985","unstructured":"Santos, C., & Magazine, M. (1985). Batching in single operation manufacturing systems. Operations Research Letters, 4, 99\u2013103.","journal-title":"Operations Research Letters"},{"key":"150_CR11","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0167-6377(92)90027-Z","volume":"11","author":"D. F. Shallcross","year":"1992","unstructured":"Shallcross, D. F. (1992). A polynomial algorithm for a one machine batching problem. Operations Research Letters, 11, 213\u2013218.","journal-title":"Operations Research Letters"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0150-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-009-0150-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0150-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:43Z","timestamp":1559468383000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-009-0150-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12,24]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["150"],"URL":"https:\/\/doi.org\/10.1007\/s10951-009-0150-8","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12,24]]}}}