{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T16:16:56Z","timestamp":1776701816697,"version":"3.51.2"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2022,2,15]],"date-time":"2022-02-15T00:00:00Z","timestamp":1644883200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,15]],"date-time":"2022-02-15T00:00:00Z","timestamp":1644883200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"L\u2019Ambassade de France en F\u00e9d\u00e9ration de Russie"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s11590-022-01857-x","type":"journal-article","created":{"date-parts":[[2022,2,15]],"date-time":"2022-02-15T17:03:16Z","timestamp":1644944596000},"page":"2557-2567","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On lower and upper bounds for single machine parallel batch scheduling"],"prefix":"10.1007","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9938-0482","authenticated-orcid":false,"given":"Evgeny R.","family":"Gafarov","sequence":"first","affiliation":[]},{"given":"Alexandre","family":"Dolgui","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,15]]},"reference":[{"key":"1857_CR1","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic machine scheduling: a survey. Ann. Discrete Math. 5, 287\u2013326 (1979)","journal-title":"Ann. Discrete Math."},{"issue":"4","key":"1857_CR2","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1287\/opre.40.4.764","volume":"40","author":"C-Y Chung-Yee Lee","year":"1992","unstructured":"Chung-Yee Lee, C.-Y., Uzsoy, R., Martin-Vega, L.A.: Efficient algorithms for scheduling semiconductor burn-in operations. Oper. Res. 40(4), 764\u2013775 (1992)","journal-title":"Oper. Res."},{"issue":"9","key":"1857_CR3","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1007\/s00170-012-3981-y","volume":"63","author":"O Batta\u00efa","year":"2012","unstructured":"Batta\u00efa, O., Dolgui, A., Guschinsky, N., Levin, G.: Optimal design of machines processing pipeline parts. Int. J. Adv. Manuf. Technol. 63(9), 963\u2013973 (2012)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"7","key":"1857_CR4","first-page":"314","volume":"57","author":"TCE Cheng","year":"2004","unstructured":"Cheng, T.C.E., Ng, C.T., Yuan, J.J., Liu, Z.H.: Single machine parallel batch scheduling subject to precedence constraints. Nav. Res. Logist. 57(7), 314\u2013324 (2004)","journal-title":"Nav. Res. Logist."},{"issue":"1","key":"1857_CR5","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10479-012-1106-5","volume":"213","author":"E Gafarov","year":"2014","unstructured":"Gafarov, E., Lazarev, A., Werner, F.: Approximability results for the resource-constrained project scheduling problem with a single type of resources. Ann. Oper. Res. 213(1), 115\u2013130 (2014)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"1857_CR6","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":"1997","unstructured":"Brucker, P., Gladky, A., Hoogeveen, H., Kovalyov, M.Y., Potts, C.N., Tautenhahn, T., van de Velde, S.L.: Scheduling a batching machine. J. Sched. 1(1), 31\u201354 (1997)","journal-title":"J. Sched."},{"key":"1857_CR7","doi-asserted-by":"publisher","first-page":"291","DOI":"10.17535\/crorr.2016.0020","volume":"7","author":"C Basnet","year":"2016","unstructured":"Basnet, C.: Heuristics for batching and sequencing in batch processing machine. Croatian Oper. Res. Rev. 7, 291\u2013302 (2016)","journal-title":"Croatian Oper. Res. Rev."},{"key":"1857_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04550-3","volume-title":"Scheduling Algorithms","author":"P Brucker","year":"2001","unstructured":"Brucker, P.: Scheduling Algorithms. Springer, Berlin (2001)"},{"key":"1857_CR9","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1080\/07408170108936864","volume":"33","author":"TCE Cheng","year":"2001","unstructured":"Cheng, T.C.E., Liu, Z.H., Yu, W.C.: Scheduling jobs with release dates and deadlines on a batch processing machine. IIE Trans. 33, 685\u2013690 (2001)","journal-title":"IIE Trans."},{"key":"1857_CR10","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/3-540-48686-0_23","volume":"1627","author":"X Deng","year":"1999","unstructured":"Deng, X., Zhang, Y.Z.: Minimizing mean response time for batch processing systems. Lect. Notes Comput. Sci. 1627, 231\u2013240 (1999)","journal-title":"Lect. Notes Comput. Sci."},{"key":"1857_CR11","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0166-218X(00)00181-5","volume":"105","author":"ZH Liu","year":"2000","unstructured":"Liu, Z.H., Yu, W.C.: Scheduling one batch processor subject to job release dates. Discrete Appl. Math. 105, 129\u2013136 (2000)","journal-title":"Discrete Appl. Math."},{"key":"1857_CR12","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s11590-014-0740-z","volume":"9","author":"J Pei","year":"2015","unstructured":"Pei, J., Liu, X., Pardalos, P.M., et al.: Single machine serial-batching scheduling with independent setup time and deteriorating job processing times. Optim. Lett. 9, 91\u2013104 (2015)","journal-title":"Optim. Lett."},{"key":"1857_CR13","doi-asserted-by":"publisher","first-page":"1257","DOI":"10.1007\/s11590-016-1074-9","volume":"11","author":"J Pei","year":"2017","unstructured":"Pei, J., Liu, X., Pardalos, P.M., et al.: Single-machine serial-batching scheduling with a machine availability constraint, position-dependent processing time, and time-dependent set-up time. Optim. Lett. 11, 1257\u20131271 (2017)","journal-title":"Optim. Lett."},{"issue":"4","key":"1857_CR14","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1007\/s11590-020-01618-8","volume":"15","author":"H Liu","year":"2020","unstructured":"Liu, H., Lu, X., Li, W.: A best possible online algorithm for parallel batch scheduling with delivery times and limited restart. Optim. Lett. 15(4), 1155\u20131173 (2020)","journal-title":"Optim. Lett."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01857-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01857-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01857-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,27]],"date-time":"2022-10-27T13:03:53Z","timestamp":1666875833000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01857-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,15]]},"references-count":14,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["1857"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01857-x","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,15]]},"assertion":[{"value":"7 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}