{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:58:55Z","timestamp":1759147135093,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,7,10]],"date-time":"2020-07-10T00:00:00Z","timestamp":1594339200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,10]],"date-time":"2020-07-10T00:00:00Z","timestamp":1594339200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s10288-020-00449-8","type":"journal-article","created":{"date-parts":[[2020,7,10]],"date-time":"2020-07-10T10:03:41Z","timestamp":1594375421000},"page":"265-288","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop"],"prefix":"10.1007","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2700-9430","authenticated-orcid":false,"given":"Arianna","family":"Alfieri","sequence":"first","affiliation":[]},{"given":"Shuyu","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Rosario","family":"Scatamacchia","sequence":"additional","affiliation":[]},{"given":"Steef L.","family":"van\u00a0de\u00a0Velde","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,10]]},"reference":[{"key":"449_CR1","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1023\/A:1022239620866","volume":"6","author":"A Agnetis","year":"2009","unstructured":"Agnetis A, Alfieri A, Nicosia G (2009) Part batching and scheduling in a flexible cell to minimize setup costs. J Sched 6:87\u2013108","journal-title":"J Sched"},{"key":"449_CR2","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1080\/0740817X.2011.649384","volume":"44","author":"A Alfieri","year":"2012","unstructured":"Alfieri A, Glass CA, van de Velde SL (2012) Lot streaming in a two-machine flow shop with attached setup times. IIE Trans 44:695\u2013710","journal-title":"IIE Trans"},{"key":"449_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Dati L, Mosheiov G, Oron D (2009) Batch scheduling on two-machine flowshop with machine-dependent setup times. Adv Oper Res 2009, 153910","DOI":"10.1155\/2009\/153910"},{"key":"449_CR4","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1057\/palgrave.jors.2602016","volume":"57","author":"D Biskup","year":"2006","unstructured":"Biskup D, Feldmann M (2006) Lot streaming with variable sublots: an integer programming formulation. J Oper Res Soc 57:296\u2013303","journal-title":"J Oper Res Soc"},{"key":"449_CR5","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":"1998","unstructured":"Brucker P, Gladky A, Hoogeveen JA, Kovalyov MY, Potts CN, Tautenhahn T, van de Velde SL (1998) Scheduling a batching machine. J Sched 1:31\u201354","journal-title":"J Sched"},{"key":"449_CR6","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1080\/07408170490245487","volume":"36","author":"J Bukchin","year":"2004","unstructured":"Bukchin J, Masin M (2004) Multi-objective lot splitting for a single product $$m$$-machine flowshop line. IIE Trans 36:191\u2013202","journal-title":"IIE Trans"},{"key":"449_CR7","first-page":"953","volume":"34","author":"J Bukchin","year":"2002","unstructured":"Bukchin J, Jaffe M, Tzur M (2002) Lot splitting to minimize average flow-time in a two-machine flow-shop. IIE Trans 34:953\u2013970","journal-title":"IIE Trans"},{"key":"449_CR8","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1080\/00207540412331325396","volume":"43","author":"JH Chang","year":"2005","unstructured":"Chang JH, Chiu HN (2005) A comprehensive review of lot streaming. Int J Prod Res 43:1515\u20131536","journal-title":"Int J Prod Res"},{"key":"449_CR9","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1016\/S0377-2217(96)00091-4","volume":"96","author":"J Chen","year":"1996","unstructured":"Chen J, Steiner G (1996) Lot streaming with detached setups in three-machine flow shops. Eur J Oper Res 96:591\u2013611","journal-title":"Eur J Oper Res"},{"key":"449_CR10","first-page":"1075","volume":"30","author":"J Chen","year":"1998","unstructured":"Chen J, Steiner G (1998) Lot streaming with attached setups in three machine flow shops. IIE Trans 30:1075\u20131084","journal-title":"IIE Trans"},{"key":"449_CR11","first-page":"160","volume":"37","author":"J Chen","year":"1999","unstructured":"Chen J, Steiner G (1999) Discrete lot streaming in two-machine flow shops. INFOR 37:160\u2013173","journal-title":"INFOR"},{"key":"449_CR12","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1080\/15458830.1996.11770748","volume":"28","author":"TCE Cheng","year":"1996","unstructured":"Cheng TCE, Chen ZI, Kovalyov MY, Lin BMT (1996) Parallel-machine batching and scheduling to minimize total completion time. IIE Trans 28:953\u2013956","journal-title":"IIE Trans"},{"key":"449_CR13","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1002\/(SICI)1520-6750(200003)47:2<128::AID-NAV4>3.0.CO;2-#","volume":"47","author":"TCE Cheng","year":"2000","unstructured":"Cheng TCE, Lin BMT, Toker A (2000) Makespan minimization in the two-machine flowshop batch scheduling problem. Nav Res Logist 47:128\u2013144","journal-title":"Nav Res Logist"},{"key":"449_CR14","doi-asserted-by":"publisher","first-page":"7023","DOI":"10.1080\/00207543.2013.774506","volume":"51","author":"M Cheng","year":"2013","unstructured":"Cheng M, Mukherjee NJ, Sarin SC (2013) A review of lot streaming. Int J Prod Res 51:7023\u20137046","journal-title":"Int J Prod Res"},{"key":"449_CR15","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10898-015-0298-z","volume":"66","author":"M Cheng","year":"2016","unstructured":"Cheng M, Sarin SC, Singh S (2016) Two-stage, single-lot, lot streaming problem for a 1+2 hybrid flow shop. J Global Optim 66:263\u2013290","journal-title":"J Global Optim"},{"key":"449_CR16","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1287\/ijoc.14.1.52.7712","volume":"14","author":"RK Congram","year":"2002","unstructured":"Congram RK, Potts CN, van de Velde SL (2002) An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS J Comput 14:52\u201367","journal-title":"INFORMS J Comput"},{"key":"449_CR17","doi-asserted-by":"publisher","first-page":"2331","DOI":"10.1080\/00207543.2011.574952","volume":"50","author":"FM Defersha","year":"2012","unstructured":"Defersha FM, Chen M (2012) Jobshop lot streaming with routing flexibility, sequence-dependent setups, machine release dates and lag time. Int J Prod Res 50:2331\u20132352","journal-title":"Int J Prod Res"},{"key":"449_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"ML Fisher","year":"1981","unstructured":"Fisher ML (1981) The lagrangian relaxation method for solving integer programming problems. Manag Sci 27:1\u201318","journal-title":"Manag Sci"},{"key":"449_CR19","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1287\/inte.15.2.10","volume":"15","author":"ML Fisher","year":"1985","unstructured":"Fisher ML (1985) An application oriented guide to lagrangian relaxation. Interfaces 15:10\u201321","journal-title":"Interfaces"},{"key":"449_CR20","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/BFb0120690","volume":"2","author":"AM Geoffrion","year":"1974","unstructured":"Geoffrion AM (1974) Lagrangian relaxation and its uses in integer programming. Math Progr Study 2:82\u2013114","journal-title":"Math Progr Study"},{"key":"449_CR21","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1287\/moor.23.3.624","volume":"23","author":"CA Glass","year":"1998","unstructured":"Glass CA, Potts CN (1998) Structural properties of lot streaming in a flow shop. Math Oper Res 23:624\u2013639","journal-title":"Math Oper Res"},{"key":"449_CR22","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/0377-2217(94)90082-5","volume":"75","author":"CA Glass","year":"1994","unstructured":"Glass CA, Gupta JND, Potts CN (1994) Lot streaming in three-stage production processes. Eur J Oper Res 75:378\u2013394","journal-title":"Eur J Oper Res"},{"key":"449_CR23","doi-asserted-by":"publisher","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M Held","year":"1970","unstructured":"Held M, Karp RM (1970) The traveling salesman problem and minimum spanning trees. Oper Res 18:1138\u20131162","journal-title":"Oper Res"},{"key":"449_CR24","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/BF01584070","volume":"1","author":"M Held","year":"1971","unstructured":"Held M, Karp RM (1971) The traveling salesman problem and minimum spanning trees: part ii. Math Program 1:6\u201325","journal-title":"Math Program"},{"key":"449_CR25","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/BF01580223","volume":"6","author":"M Held","year":"1974","unstructured":"Held M, Wolfe P, Crowder H (1974) Validation of subgradient optimization. Math Program 6:62\u201388","journal-title":"Math Program"},{"key":"449_CR26","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1111\/j.1540-5915.2001.tb00964.x","volume":"32","author":"AA Kalir","year":"2001","unstructured":"Kalir AA, Sarin SC (2001) Optimal solution for the single batch flow-shop lot streaming problem with equal sublots. Decis Sci 32:387\u2013397","journal-title":"Decis Sci"},{"key":"449_CR27","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1023\/A:1021942422161","volume":"7","author":"AA Kalir","year":"2003","unstructured":"Kalir AA, Sarin SC (2003) Constructing near optimal schedules for the flow-shop lot streaming problem with sublot-attached setups. J Combin Optim 7:23\u201344","journal-title":"J Combin Optim"},{"key":"449_CR28","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/j.ijpe.2007.10.002","volume":"113","author":"AA Kalir","year":"2008","unstructured":"Kalir AA, Sarin SC (2008) A single-lot, unified cost-based flow shop lot-streaming problem. Int J Prod Econ 113:413\u2013424","journal-title":"Int J Prod Econ"},{"key":"449_CR29","doi-asserted-by":"publisher","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. Nav Res Logist 51:783\u2013799","journal-title":"Nav Res Logist"},{"key":"449_CR30","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0167-6377(89)90013-8","volume":"8","author":"CN Potts","year":"1989","unstructured":"Potts CN, Baker KR (1989) Flow shop scheduling with lot streaming. Oper Res Lett 8:297\u2013303","journal-title":"Oper Res Lett"},{"key":"449_CR31","doi-asserted-by":"publisher","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. Oper Res Lett 4:99\u2013103","journal-title":"Oper Res Lett"},{"key":"449_CR32","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0167-5060(08)70346-7","volume":"5","author":"JF Shapiro","year":"1979","unstructured":"Shapiro JF (1979) A survey of lagrangian techniques for discrete optimization. Ann Discret Math 5:113\u2013138","journal-title":"Ann Discret Math"},{"key":"449_CR33","volume-title":"Inventory management and production planning and scheduling","author":"EA Silver","year":"1998","unstructured":"Silver EA, Pyke DF, Peterson R (1998) Inventory management and production planning and scheduling. Wiley, New York"},{"key":"449_CR34","unstructured":"Trietsch D (1987) Optimal transfer lots for batch manufacturing: a base case and extensions. Technical report nps-54-89-011, Naval Postgraduate School, Monterey, California"},{"key":"449_CR35","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1287\/opre.41.6.1065","volume":"41","author":"D Trietsch","year":"1993","unstructured":"Trietsch D, Baker KR (1993) Basic techniques for lot streaming. Oper Res 41:1065\u20131076","journal-title":"Oper Res"},{"key":"449_CR36","doi-asserted-by":"publisher","first-page":"2718","DOI":"10.1016\/j.cor.2005.10.014","volume":"34","author":"H Xuan","year":"2007","unstructured":"Xuan H, Tang LX (2007) Scheduling a hybrid flowshop with batch production at the last stage. Comput Oper Res 34:2718\u20132733","journal-title":"Comput Oper Res"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-020-00449-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10288-020-00449-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-020-00449-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,10]],"date-time":"2021-07-10T00:38:09Z","timestamp":1625877489000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10288-020-00449-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,10]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["449"],"URL":"https:\/\/doi.org\/10.1007\/s10288-020-00449-8","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"type":"print","value":"1619-4500"},{"type":"electronic","value":"1614-2411"}],"subject":[],"published":{"date-parts":[[2020,7,10]]},"assertion":[{"value":"13 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 May 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 July 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}