{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T16:28:55Z","timestamp":1775838535194,"version":"3.50.1"},"reference-count":177,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,2,1]],"date-time":"2016-02-01T00:00:00Z","timestamp":1454284800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s00291-015-0429-4","type":"journal-article","created":{"date-parts":[[2016,2,1]],"date-time":"2016-02-01T14:40:04Z","timestamp":1454337604000},"page":"1-64","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":137,"title":["Simultaneous lotsizing and scheduling problems: a classification and review of models"],"prefix":"10.1007","volume":"39","author":[{"given":"Karina","family":"Copil","sequence":"first","affiliation":[]},{"given":"Martin","family":"W\u00f6rbelauer","sequence":"additional","affiliation":[]},{"given":"Herbert","family":"Meyr","sequence":"additional","affiliation":[]},{"given":"Horst","family":"Tempelmeier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,2,1]]},"reference":[{"issue":"1","key":"429_CR1","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/j.ijpe.2007.02.052","volume":"114","author":"B Almada-Lobo","year":"2008","unstructured":"Almada-Lobo B, Carravilla MA, Oliveira JF (2008) Production planning and scheduling in the glass container industry: a VNS approach. Int J Prod Econ 114(1):363\u2013375","journal-title":"Int J Prod Econ"},{"issue":"3","key":"429_CR2","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1080\/00207540802446787","volume":"48","author":"B Almada-Lobo","year":"2010","unstructured":"Almada-Lobo B, James RJW (2010) Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups. Int J Prod Res 48(3):861\u2013878","journal-title":"Int J Prod Res"},{"issue":"20","key":"429_CR3","doi-asserted-by":"crossref","first-page":"4873","DOI":"10.1080\/00207540601094465","volume":"45","author":"B Almada-Lobo","year":"2007","unstructured":"Almada-Lobo B, Klabjan D, Carravilla MA, Oliveira JF (2007) Single machine multi-product capacitated lot sizing with sequence-dependent setups. Int J Prod Res 45(20):4873\u20134894","journal-title":"Int J Prod Res"},{"issue":"3","key":"429_CR4","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/s10589-009-9235-8","volume":"47","author":"B Almada-Lobo","year":"2010","unstructured":"Almada-Lobo B, Klabjan D, Carravilla MA, Oliveira JF (2010) Multiple machine continuous setup lotsizing with sequence-dependent setups. Comput Optim Appl 47(3):529\u2013552","journal-title":"Comput Optim Appl"},{"issue":"24","key":"429_CR5","doi-asserted-by":"crossref","first-page":"7315","DOI":"10.1080\/00207543.2010.535570","volume":"49","author":"C Almeder","year":"2011","unstructured":"Almeder C, Almada-Lobo B (2011) Synchronisation of scarce resources for a parallel machine lotsizing problem. Int J Prod Res 49(24):7315\u20137335","journal-title":"Int J Prod Res"},{"issue":"3","key":"429_CR6","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1016\/j.ejor.2014.09.030","volume":"241","author":"C Almeder","year":"2015","unstructured":"Almeder C, Klabjan D, Traxler R, Almada-Lobo B (2015) Lead time considerations for the multi-level capacitated lot-sizing problem. Eur J Oper Res 241(3):727\u2013738","journal-title":"Eur J Oper Res"},{"issue":"6","key":"429_CR7","doi-asserted-by":"crossref","first-page":"3371","DOI":"10.1021\/ie101645h","volume":"50","author":"P Amorim","year":"2011","unstructured":"Amorim P, Antunes CH, Almada-Lobo B (2011) Multi-objective lot-sizing and scheduling dealing with perishability issues. Ind Eng Chem Res 50(6):3371\u20133381","journal-title":"Ind Eng Chem Res"},{"issue":"1","key":"429_CR8","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.ijpe.2012.03.005","volume":"138","author":"P Amorim","year":"2012","unstructured":"Amorim P, G\u00fcnther H-O, Almada-Lobo B (2012) Multi-objective integrated production and distribution planning of perishable products. Int J Prod Econ 138(1):89\u2013101","journal-title":"Int J Prod Econ"},{"key":"429_CR9","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.compchemeng.2013.01.006","volume":"52","author":"P Amorim","year":"2013","unstructured":"Amorim P, Pinto-Varela T, Almada-Lobo B, Barb\u00f3sa-P\u00f3voa APFD (2013) Comparing models for lot-sizing and scheduling of single-stage continuous processes: Operations research and process systems engineering approaches. Comput Chem Eng 52:177\u2013192","journal-title":"Comput Chem Eng"},{"issue":"3","key":"429_CR10","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0272-6963(82)90005-5","volume":"2","author":"O Aras","year":"1982","unstructured":"Aras O, Swanson L (1982) A lot sizing and sequencing algorithm for dynamic demands upon a single facility. J Oper Manag 2(3):177\u2013185","journal-title":"J Oper Manag"},{"issue":"1\u20134","key":"429_CR11","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s00170-013-5252-y","volume":"70","author":"M Babaei","year":"2014","unstructured":"Babaei M, Mohammadi M, Ghomi SMTF (2014) A genetic algorithm for the simultaneous lot sizing and scheduling problem in capacitated flow shop with complex setups and backlogging. Int J Adv Manuf Technol 70(1\u20134):125\u2013134","journal-title":"Int J Adv Manuf Technol"},{"key":"429_CR12","unstructured":"Baker T, Muckstadt J Jr (1989) The CHES problems. Chesapeake Decision Sciences Inc, Tech. rep"},{"key":"429_CR13","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.cie.2014.02.008","volume":"72","author":"TA Baldo","year":"2014","unstructured":"Baldo TA, Santos MO, Almada-Lobo B, Neto RM (2014) An optimization approach for the lot sizing and scheduling problem in the brewery industry. Comput Ind Eng 72:58\u201371","journal-title":"Comput Ind Eng"},{"issue":"2","key":"429_CR14","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1023\/A:1024998617280","volume":"2","author":"W Br\u00fcggemann","year":"2003","unstructured":"Br\u00fcggemann W, Fischer K, Jahnke H (2003a) Problems, models and complexity. Part I: theory. J Math Model Algorithms 2(2):121\u2013151","journal-title":"J Math Model Algorithms"},{"issue":"2","key":"429_CR15","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1023\/A:1024979501350","volume":"2","author":"W Br\u00fcggemann","year":"2003","unstructured":"Br\u00fcggemann W, Fischer K, Jahnke H (2003b) Problems, models and complexity. Part II: application to the DLSP. J Math Model Algorithms 2(2):153\u2013169","journal-title":"J Math Model Algorithms"},{"issue":"4","key":"429_CR16","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1080\/00207549408956968","volume":"32","author":"W Br\u00fcggemann","year":"1994","unstructured":"Br\u00fcggemann W, Jahnke H (1994) DLSP for two-stage multi-item batch production. Int J Prod Res 32(4):755\u2013768","journal-title":"Int J Prod Res"},{"issue":"3","key":"429_CR17","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1016\/S0377-2217(99)00190-3","volume":"124","author":"W Br\u00fcggemann","year":"2000","unstructured":"Br\u00fcggemann W, Jahnke H (2000a) The discrete lot-sizing and scheduling problem: complexity and modification for batch availability. Eur J Oper Res 124(3):511\u2013528","journal-title":"Eur J Oper Res"},{"key":"429_CR18","doi-asserted-by":"crossref","unstructured":"Br\u00fcggemann W, Jahnke H (2000b) Erratum to \u201cThe discrete lot-sizing and scheduling problem: complexity and modification for batch availability\u201d [EJOR 124 (3) (2000) 511\u2013528]. Eur J Oper Res 126(3):688","DOI":"10.1016\/S0377-2217(00)00173-9"},{"issue":"2","key":"429_CR19","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s00291-008-0150-7","volume":"32","author":"L Buschk\u00fchl","year":"2010","unstructured":"Buschk\u00fchl L, Sahling F, Helber S, Tempelmeier H (2010) Dynamic capacitated lot-sizing problems: a classification and review of solution approaches. OR Spectr 32(2):231\u2013261","journal-title":"OR Spectr"},{"key":"429_CR20","doi-asserted-by":"crossref","first-page":"1613","DOI":"10.1057\/jors.2011.159","volume":"63","author":"VCB Camargo","year":"2012","unstructured":"Camargo VCB, Toledo FMB, Almada-Lobo B (2012) Three time-based scale formulations for the two stage lot sizing and scheduling in process industries. J Oper Res Soc 63:1613\u20131630","journal-title":"J Oper Res Soc"},{"issue":"1","key":"429_CR21","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1016\/j.ejor.2013.10.017","volume":"234","author":"VCB Camargo","year":"2014","unstructured":"Camargo VCB, Toledo FMB, Almada-Lobo B (2014) HOPS\u2014hamming-oriented partition search for production planning in the spinning industry. Eur J Oper Res 234(1):266\u2013277","journal-title":"Eur J Oper Res"},{"issue":"3","key":"429_CR22","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1111\/j.1937-5956.1992.tb00361.x","volume":"1","author":"GM Campbell","year":"1992","unstructured":"Campbell GM (1992) Using short-term dedication for scheduling multiple products on parallel machines. Prod Oper Manag 1(3):295\u2013307","journal-title":"Prod Oper Manag"},{"issue":"4","key":"429_CR23","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1287\/mnsc.39.4.477","volume":"39","author":"D Cattrysse","year":"1993","unstructured":"Cattrysse D, Salomon M, Kuik R, Van Wassenhove LN (1993) A dual ascent and column generation heuristic for the discrete lotsizing and scheduling problem with setup times. Manag Sci 39(4):477\u2013486","journal-title":"Manag Sci"},{"issue":"1","key":"429_CR24","first-page":"11","volume":"1","author":"P Chang","year":"2004","unstructured":"Chang P, Chang C, Chen C (2004) An extension of the multi-machine multi-level proportional lot sizing and scheduling model for product-life-cycle demand. Int J Oper Res 1(1):11\u201322","journal-title":"Int J Oper Res"},{"issue":"2","key":"429_CR25","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0925-5273(02)00400-0","volume":"84","author":"AR Clark","year":"2003","unstructured":"Clark AR (2003) Optimization approximations for capacity constrained material requirements planning. Int J Prod Econ 84(2):115\u2013131","journal-title":"Int J Prod Econ"},{"issue":"10","key":"429_CR26","doi-asserted-by":"crossref","first-page":"2287","DOI":"10.1080\/00207540050028106","volume":"38","author":"AR Clark","year":"2000","unstructured":"Clark AR, Clark SJ (2000) Rolling-horizon lot-sizing when set-up times are sequence-dependent. Int J Prod Res 38(10):2287\u20132307","journal-title":"Int J Prod Res"},{"issue":"8","key":"429_CR27","doi-asserted-by":"crossref","first-page":"2490","DOI":"10.1080\/00207543.2014.885662","volume":"52","author":"AR Clark","year":"2014","unstructured":"Clark AR, Mahdieh M, Rangel S (2014) Production lot sizing and scheduling with non-triangular sequence-dependent setup times. Int J Prod Res 52(8):2490\u20132503","journal-title":"Int J Prod Res"},{"issue":"2","key":"429_CR28","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s10951-009-0135-7","volume":"13","author":"AR Clark","year":"2010","unstructured":"Clark AR, Morabito R, Toso EAV (2010) Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching. J Sched 13(2):111\u2013121","journal-title":"J Sched"},{"issue":"1\u20134","key":"429_CR29","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1023\/A:1018963805173","volume":"96","author":"M Constantino","year":"2000","unstructured":"Constantino M (2000) A polyhedral approach to a production planning problem. Ann Oper Res 96(1\u20134):75\u201395","journal-title":"Ann Oper Res"},{"issue":"11","key":"429_CR30","doi-asserted-by":"crossref","first-page":"2987","DOI":"10.1016\/j.cor.2004.04.012","volume":"32","author":"SG Dastidar","year":"2005","unstructured":"Dastidar SG, Nagi R (2005) Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs. Comput Oper Res 32(11):2987\u20133005","journal-title":"Comput Oper Res"},{"issue":"3","key":"429_CR31","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/0377-2217(94)90085-X","volume":"28","author":"S Dauz\u00e8re-P\u00e9r\u00e8s","year":"1994","unstructured":"Dauz\u00e8re-P\u00e9r\u00e8s S, Lasserre J-B (1994) Integration of lotsizing and scheduling decisions in a job-shop. Eur J Oper Res 28(3):413\u2013426","journal-title":"Eur J Oper Res"},{"issue":"6","key":"429_CR32","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1111\/1475-3995.00388","volume":"9","author":"S Dauz\u00e8re-P\u00e9r\u00e8s","year":"2002","unstructured":"Dauz\u00e8re-P\u00e9r\u00e8s S, Lasserre J-B (2002) On the importance of sequencing decisions in production planning and scheduling. Int Trans Oper Res 9(6):779\u2013793","journal-title":"Int Trans Oper Res"},{"issue":"4","key":"429_CR33","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s10732-007-9011-9","volume":"13","author":"SA Araujo de","year":"2007","unstructured":"de Araujo SA, Arenales MN, Clark AR (2007) Joint rolling-horizon scheduling of materials processing and lot-sizing with sequence-dependent setups. J Heuristics 13(4):337\u2013358","journal-title":"J Heuristics"},{"issue":"3","key":"429_CR34","doi-asserted-by":"crossref","first-page":"916","DOI":"10.1016\/j.cor.2006.05.010","volume":"35","author":"SA Araujo de","year":"2008","unstructured":"de Araujo SA, Arenales MN, Clark AR (2008) Lot sizing and furnace scheduling in small foundries. Comput Oper Res 35(3):916\u2013932","journal-title":"Comput Oper Res"},{"issue":"4","key":"429_CR35","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1016\/j.cie.2013.04.003","volume":"65","author":"SA Araujo de","year":"2013","unstructured":"de Araujo SA, Clark AR (2013) A priori reformulations for joint rolling-horizon scheduling of materials processing and lot-sizing problem. Comput Ind Eng 65(4):577\u2013585","journal-title":"Comput Ind Eng"},{"issue":"1","key":"429_CR36","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0377-2217(94)90393-X","volume":"79","author":"R Matta de","year":"1994","unstructured":"de Matta R (1994) A Lagrangean decomposition solution to a single line multiproduct scheduling problem. Eur J Oper Res 79(1):25\u201337","journal-title":"Eur J Oper Res"},{"issue":"3","key":"429_CR37","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1287\/opre.42.3.492","volume":"42","author":"R Matta de","year":"1994","unstructured":"de Matta R, Guignard M (1994a) Dynamic production scheduling for a process industry. Oper Res 42(3):492\u2013503","journal-title":"Oper Res"},{"issue":"1","key":"429_CR38","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/0377-2217(94)90330-1","volume":"72","author":"R Matta de","year":"1994","unstructured":"de Matta R, Guignard M (1994b) Studying the effects of production loss due to setup in dynamic production scheduling. Eur J Oper Res 72(1):62\u201373","journal-title":"Eur J Oper Res"},{"issue":"5","key":"429_CR39","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1080\/07408179508936772","volume":"27","author":"R Matta de","year":"1995","unstructured":"de Matta R, Guignard M (1995) The performance of rolling production schedules in a process industry. IIE Trans 27(5):564\u2013573","journal-title":"IIE Trans"},{"key":"429_CR40","doi-asserted-by":"crossref","unstructured":"de Souza PS, Talukdar SN (1993) Asynchronous organizations for multialgorithm problems. In: Proceedings of the 1993 ACM\/SIGAPP symposium on applied computing: states of the art and practice, SAC n++93, pp 286\u2013293","DOI":"10.1145\/162754.162902"},{"issue":"1","key":"429_CR41","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0925-5273(95)00040-U","volume":"40","author":"A Drexl","year":"1995","unstructured":"Drexl A, Haase K (1995) Proportional lotsizing and scheduling. Int J Prod Econ 40(1):73\u201387","journal-title":"Int J Prod Econ"},{"issue":"2","key":"429_CR42","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1057\/jors.1996.23","volume":"47","author":"A Drexl","year":"1996","unstructured":"Drexl A, Haase K (1996) Sequential-analysis based randomized-regret-methods for lot-sizing and scheduling. J Oper Res Soc 47(2):251\u2013265","journal-title":"J Oper Res Soc"},{"issue":"3","key":"429_CR43","first-page":"267","volume":"65","author":"A Drexl","year":"1995","unstructured":"Drexl A, Haase K, Kimms A (1995) Losgr\u00f6\u00dfen- und Ablaufplanung in PPS-Systemen auf der Basis randomisierter Opportunit\u00e4tskosten. Z Betriebswirtschaft 65(3):267\u2013285","journal-title":"Z Betriebswirtschaft"},{"issue":"2","key":"429_CR44","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0377-2217(97)00030-1","volume":"99","author":"A Drexl","year":"1997","unstructured":"Drexl A, Kimms A (1997) Lot sizing and scheduling\u2014survey and extensions. Eur J Oper Res 99(2):221\u2013235","journal-title":"Eur J Oper Res"},{"issue":"2","key":"429_CR45","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1287\/opre.43.2.367","volume":"43","author":"Y Dumas","year":"1995","unstructured":"Dumas Y, Desrosiers J, Gelinas E, Solomon MM (1995) An optimal algorithm for the traveling salesman problem with time windows. Oper Res 43(2):367\u2013371","journal-title":"Oper Res"},{"issue":"6","key":"429_CR46","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1287\/opre.35.6.832","volume":"35","author":"GD Eppen","year":"1987","unstructured":"Eppen GD, Martin RK (1987) Solving multi-item capacitated lot-sizing problems using variable redefinition. Oper Res 35(6):832\u2013848","journal-title":"Oper Res"},{"issue":"11","key":"429_CR47","doi-asserted-by":"crossref","first-page":"2664","DOI":"10.1016\/j.compchemeng.2007.07.010","volume":"32","author":"M Erdirik-Dogan","year":"2008","unstructured":"Erdirik-Dogan M, Grossmann IE (2008) Simultaneous planning and scheduling of single-stage multi-product continuous plants with parallel lines. Comput Chem Eng 32(11):2664\u20132684","journal-title":"Comput Chem Eng"},{"issue":"2","key":"429_CR48","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/j.ijpe.2005.04.011","volume":"104","author":"G Fandel","year":"2006","unstructured":"Fandel G, Stammen-Hegener C (2006) Simultaneous lot sizing and scheduling for multi-product multi-level production. Int J Prod Econ 104(2):308\u2013316","journal-title":"Int J Prod Econ"},{"issue":"2","key":"429_CR49","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.ijpe.2011.11.028","volume":"136","author":"D Ferreira","year":"2012","unstructured":"Ferreira D, Clark AR, Almada-Lobo B, Morabito Neto R (2012) Single-stage formulations for synchronised two-stage lot sizing and scheduling in soft drink production. Int J Prod Econ 136(2):255\u2013265","journal-title":"Int J Prod Econ"},{"issue":"2","key":"429_CR50","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1016\/j.ejor.2008.03.035","volume":"196","author":"D Ferreira","year":"2009","unstructured":"Ferreira D, Morabito Neto R, Rangel S (2009) Solution approaches for the soft drink integrated production lot sizing and scheduling problem. Eur J Oper Res 196(2):697\u2013706","journal-title":"Eur J Oper Res"},{"issue":"4","key":"429_CR51","doi-asserted-by":"crossref","first-page":"684","DOI":"10.1016\/j.cor.2009.06.007","volume":"37","author":"D Ferreira","year":"2010","unstructured":"Ferreira D, Morabito Neto R, Rangel S (2010) Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants. Comput Oper Res 37(4):684\u2013691","journal-title":"Comput Oper Res"},{"issue":"7","key":"429_CR52","doi-asserted-by":"crossref","first-page":"1804","DOI":"10.1016\/j.cor.2013.01.015","volume":"40","author":"G Figueira","year":"2013","unstructured":"Figueira G, Santos MO, Almada-Lobo B (2013) A hybrid VNS approach for the short-term production planning and scheduling: a case study in the pulp and paper industry. Comput Oper Res 40(7):1804\u20131818","journal-title":"Comput Oper Res"},{"issue":"20","key":"429_CR53","doi-asserted-by":"crossref","first-page":"5809","DOI":"10.1080\/00207543.2011.628955","volume":"50","author":"MAF Filho","year":"2012","unstructured":"Filho MAF, Santos MO, Meneses CN (2012) Asynchronous teams for joint lot-sizing and scheduling problem in flow shops. Int J Prod Res 50(20):5809\u20135822","journal-title":"Int J Prod Res"},{"issue":"3","key":"429_CR54","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0377-2217(90)90245-7","volume":"44","author":"B Fleischmann","year":"1990","unstructured":"Fleischmann B (1990) The discrete lot-sizing and scheduling problem. Eur J Oper Res 44(3):337\u2013348","journal-title":"Eur J Oper Res"},{"issue":"2","key":"429_CR55","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/0377-2217(94)90083-3","volume":"75","author":"B Fleischmann","year":"1994","unstructured":"Fleischmann B (1994) The discrete lot-sizing and scheduling problem with sequence-dependent setup costs. Eur J Oper Res 75(2):395\u2013404","journal-title":"Eur J Oper Res"},{"issue":"1","key":"429_CR56","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF01539800","volume":"19","author":"B Fleischmann","year":"1997","unstructured":"Fleischmann B, Meyr H (1997) The general lotsizing and scheduling problem. OR Spectr 19(1):11\u201321","journal-title":"OR Spectr"},{"key":"429_CR57","unstructured":"Furlan MM, Almada-Lobo B, Santos MO, Morabito Neto R (2013) A genetic algorithm-based heuristic with unequal individuals to tackle the lot-sizing and scheduling problem. In: Proceedings of XLV SBPO\u2014Simp\u00f6sio Brasileiro de Pesquisa Operacional, pp 3505\u20133516"},{"key":"429_CR58","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.cor.2014.12.008","volume":"59","author":"MM Furlan","year":"2015","unstructured":"Furlan MM, Almada-Lobo B, Santos MO, Morabito Neto R (2015) Unequal individual genetic algorithm with intelligent diversification for the lot-scheduling problem in integrated mills using multiple-paper machines. Comput Oper Res 59:33\u201350","journal-title":"Comput Oper Res"},{"issue":"4","key":"429_CR59","doi-asserted-by":"crossref","first-page":"1010","DOI":"10.1287\/opre.1080.0525","volume":"56","author":"F Gaglioppa","year":"2008","unstructured":"Gaglioppa F, Miller LA, Benjaafar S (2008) Multitask and multistage production planning and scheduling for process industries. Oper Res 56(4):1010\u20131025","journal-title":"Oper Res"},{"key":"429_CR60","doi-asserted-by":"crossref","unstructured":"Gicquel C (2008) MIP models and exact methods for the discrete lot-sizing and scheduling problem with sequence-dependent changeover costs and times. Ph.D. thesis, \u00c9cole Centrale Paris","DOI":"10.1016\/j.orl.2008.10.001"},{"issue":"2","key":"429_CR61","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/j.ejor.2014.02.027","volume":"237","author":"C Gicquel","year":"2014","unstructured":"Gicquel C, Lisser A, Minoux M (2014) An evaluation of semidefinite programming based approaches for discrete lot-sizing problems. Eur J Oper Res 237(2):498\u2013507","journal-title":"Eur J Oper Res"},{"issue":"9","key":"429_CR62","doi-asserted-by":"crossref","first-page":"2690","DOI":"10.1016\/j.cor.2008.11.017","volume":"36","author":"C Gicquel","year":"2009","unstructured":"Gicquel C, Mi\u00e8geville N, Minoux M, Dallery Y (2009a) Discrete lot sizing and scheduling using product decomposition into attributes. Comput Oper Res 36(9):2690\u20132698","journal-title":"Comput Oper Res"},{"key":"429_CR63","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.cor.2014.08.022","volume":"54","author":"C Gicquel","year":"2015","unstructured":"Gicquel C, Minoux M (2015) Multi-product valid inequalities for the discrete lot-sizing and scheduling problem. Comput Oper Res 54:12\u201320","journal-title":"Comput Oper Res"},{"issue":"1","key":"429_CR64","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.orl.2008.10.001","volume":"37","author":"C Gicquel","year":"2009","unstructured":"Gicquel C, Minoux M, Dallery Y (2009b) On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times. Oper Res Lett 37(1):32\u201336","journal-title":"Oper Res Lett"},{"issue":"9","key":"429_CR65","doi-asserted-by":"crossref","first-page":"2587","DOI":"10.1080\/00207543.2010.532927","volume":"49","author":"C Gicquel","year":"2011","unstructured":"Gicquel C, Minoux M, Dallery Y (2011) Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources. Int J Prod Res 49(9):2587\u20132603","journal-title":"Int J Prod Res"},{"issue":"3","key":"429_CR66","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/s11590-011-0280-8","volume":"6","author":"C Gicquel","year":"2012","unstructured":"Gicquel C, Wolsey LA, Minoux M (2012) On discrete lot-sizing and scheduling on identical parallel machines. Optim Lett 6(3):545\u2013557","journal-title":"Optim Lett"},{"issue":"3","key":"429_CR67","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0925-5273(00)00162-6","volume":"78","author":"M G\u00f6the-Lundgren","year":"2002","unstructured":"G\u00f6the-Lundgren M, Lundgren JT, Persson JA (2002) An optimization model for refinery production scheduling. Int J Prod Econ 78(3):255\u2013270","journal-title":"Int J Prod Econ"},{"key":"429_CR68","volume-title":"Multi-level sequence-dependent dynamic lotsizing and scheduling","author":"T Gr\u00fcnert","year":"1998","unstructured":"Gr\u00fcnert T (1998) Multi-level sequence-dependent dynamic lotsizing and scheduling. Shaker Verlag, Aachen"},{"issue":"2","key":"429_CR69","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1016\/j.ejor.2013.04.030","volume":"230","author":"L Guimar\u00e3es","year":"2013","unstructured":"Guimar\u00e3es L, Klabjan D, Almada-Lobo B (2013) Pricing, relaxing and fixing under lot sizing and scheduling. Eur J Oper Res 230(2):399\u2013411","journal-title":"Eur J Oper Res"},{"issue":"3","key":"429_CR70","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1016\/j.ejor.2014.05.018","volume":"239","author":"L Guimar\u00e3es","year":"2014","unstructured":"Guimar\u00e3es L, Klabjan D, Almada-Lobo B (2014) Modeling lotsizing and scheduling problems with sequence dependent setups. Eur J Oper Res 239(3):644\u2013662","journal-title":"Eur J Oper Res"},{"issue":"1","key":"429_CR71","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s40685-014-0003-y","volume":"7","author":"H-O G\u00fcnther","year":"2014","unstructured":"G\u00fcnther H-O (2014) The block planning approach for continuous time-based dynamic lot sizing and scheduling. Bus Res 7(1):51\u201376","journal-title":"Bus Res"},{"issue":"18\u201319","key":"429_CR72","doi-asserted-by":"crossref","first-page":"3711","DOI":"10.1080\/00207540600589127","volume":"44","author":"H-O G\u00fcnther","year":"2006","unstructured":"G\u00fcnther H-O, Grunow M, Neuhaus U (2006) Realizing block planning concepts in make-and-pack production using MILP modelling and SAP APO. Int J Prod Res 44(18\u201319):3711\u20133726","journal-title":"Int J Prod Res"},{"issue":"4","key":"429_CR73","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1016\/j.cor.2003.08.014","volume":"32","author":"D Gupta","year":"2005","unstructured":"Gupta D, Magnusson T (2005) The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times. Comput Oper Res 32(4):727\u2013747","journal-title":"Comput Oper Res"},{"key":"429_CR74","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-45735-7","volume-title":"Lotsizing and scheduling for production planning","author":"K Haase","year":"1994","unstructured":"Haase K (1994) Lotsizing and scheduling for production planning. Springer, Berlin"},{"issue":"1","key":"429_CR75","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF01539882","volume":"18","author":"K Haase","year":"1996","unstructured":"Haase K (1996) Capacitated lot-sizing with sequence dependent setup costs. OR Spectr 18(1):51\u201359","journal-title":"OR Spectr"},{"issue":"2","key":"429_CR76","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0925-5273(99)00119-X","volume":"66","author":"K Haase","year":"2000","unstructured":"Haase K, Kimms A (2000) Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities. Int J Prod Econ 66(2):159\u2013169","journal-title":"Int J Prod Econ"},{"key":"429_CR77","unstructured":"Harris FW (1913) How many parts to make at once. Fact Mag Manag 10(2):135\u2013136, 152"},{"issue":"3","key":"429_CR78","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/0377-2217(92)90198-I","volume":"59","author":"RMJ Heuts","year":"1992","unstructured":"Heuts RMJ, Seidel HP, Selen WJ (1992) A comparison of two lot sizing-sequencing heuristics for the process industry. Eur J Oper Res 59(3):413\u2013424","journal-title":"Eur J Oper Res"},{"issue":"12","key":"429_CR79","doi-asserted-by":"crossref","first-page":"1816","DOI":"10.1016\/j.cor.2011.02.005","volume":"38","author":"RJW James","year":"2011","unstructured":"James RJW, Almada-Lobo B (2011) Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics. Comput Oper Res 38(12):1816\u20131825","journal-title":"Comput Oper Res"},{"issue":"1","key":"429_CR80","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1080\/07408170490247296","volume":"36","author":"R Jans","year":"2004","unstructured":"Jans R, Degraeve Z (2004) An industrial extension of the discrete lot-sizing and scheduling problem. IIE Trans 36(1):47\u201358","journal-title":"IIE Trans"},{"issue":"6","key":"429_CR81","doi-asserted-by":"crossref","first-page":"1619","DOI":"10.1080\/00207540600902262","volume":"46","author":"R Jans","year":"2008","unstructured":"Jans R, Degraeve Z (2008) Modeling industrial lot sizing problems: a review. Int J Prod Res 46(6):1619\u20131643","journal-title":"Int J Prod Res"},{"issue":"5","key":"429_CR82","doi-asserted-by":"crossref","first-page":"698","DOI":"10.1287\/mnsc.44.5.698","volume":"44","author":"C Jordan","year":"1998","unstructured":"Jordan C, Drexl A (1998) Discrete lotsizing and scheduling by batch sequencing. Manag Sci 44(5):698\u2013713","journal-title":"Manag Sci"},{"issue":"9","key":"429_CR83","doi-asserted-by":"crossref","first-page":"2605","DOI":"10.1080\/00207543.2010.532929","volume":"49","author":"W Kaczmarczyk","year":"2011","unstructured":"Kaczmarczyk W (2011) Proportional lot-sizing and scheduling problem with identical parallel machines. Int J Prod Res 49(9):2605\u20132623","journal-title":"Int J Prod Res"},{"issue":"2","key":"429_CR84","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1287\/mnsc.45.2.273","volume":"45","author":"S Kang","year":"1999","unstructured":"Kang S, Malik K, Thomas LJ (1999) Lotsizing and scheduling on parallel machines with sequence-dependent setup costs. Manag Sci 45(2):273\u2013289","journal-title":"Manag Sci"},{"key":"429_CR85","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/j.cie.2015.03.020","volume":"85","author":"M Karimi-Nasab","year":"2015","unstructured":"Karimi-Nasab M, Modarres M (2015) Lot sizing and job shop scheduling with compressible process times: a cut and branch approach. Comput Ind Eng 85:196\u2013205","journal-title":"Comput Ind Eng"},{"key":"429_CR86","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/j.asoc.2014.10.015","volume":"27","author":"M Karimi-Nasab","year":"2015","unstructured":"Karimi-Nasab M, Modarres M, Seyedhoseini S (2015) A self-adaptive PSO for joint lot sizing and job shop scheduling with compressible process times. Appl Soft Comput 27:137\u2013147","journal-title":"Appl Soft Comput"},{"issue":"3","key":"429_CR87","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1016\/j.ejor.2013.06.021","volume":"231","author":"M Karimi-Nasab","year":"2013","unstructured":"Karimi-Nasab M, Seyedhoseini SM (2013) Multi-level lot sizing and job shop scheduling with compressible process times: a cutting plane approach. Eur J Oper Res 231(3):598\u2013616","journal-title":"Eur J Oper Res"},{"issue":"20","key":"429_CR88","doi-asserted-by":"crossref","first-page":"6229","DOI":"10.1080\/00207543.2013.825743","volume":"51","author":"M Karimi-Nasab","year":"2013","unstructured":"Karimi-Nasab M, Seyedhoseini SM, Modarres M, Heidari M (2013) Multi-period lot sizing and job shop scheduling with compressible process times for multilevel product structures. Int J Prod Res 51(20):6229\u20136246","journal-title":"Int J Prod Res"},{"issue":"2","key":"429_CR89","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1287\/opre.33.2.326","volume":"33","author":"US Karmarkar","year":"1985","unstructured":"Karmarkar US, Schrage L (1985) The deterministic dynamic product cycling problem. Oper Res 33(2):326\u2013345","journal-title":"Oper Res"},{"key":"429_CR90","unstructured":"Kilger C, Meyr H (2015) Demand fulfillment and ATP. In: Stadtler H, Kilger C, Meyr H (eds) Supply chain management and advanced planning, 5th edn. Springer texts in business and economics, vol 9. Springer, Berlin, pp 177\u2013194"},{"issue":"8","key":"429_CR91","doi-asserted-by":"crossref","first-page":"2279","DOI":"10.1080\/00207549608905025","volume":"34","author":"A Kimms","year":"1996","unstructured":"Kimms A (1996a) Competitive methods for multi-level lot sizing and scheduling: tabu search and randomized regrets. Int J Prod Res 34(8):2279\u20132298","journal-title":"Int J Prod Res"},{"issue":"1","key":"429_CR92","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/S0377-2217(96)90056-9","volume":"89","author":"A Kimms","year":"1996","unstructured":"Kimms A (1996b) Multi-level, single-machine lot sizing and scheduling (with initial inventory). Eur J Oper Res 89(1):86\u201399","journal-title":"Eur J Oper Res"},{"issue":"4","key":"429_CR93","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/(SICI)1520-6750(199706)44:4<319::AID-NAV3>3.0.CO;2-9","volume":"44","author":"A Kimms","year":"1997","unstructured":"Kimms A (1997a) Demand shuffle\u2014a method for multilevel proportional lot sizing and scheduling. Nav Res Logist 44(4):319\u2013340","journal-title":"Nav Res Logist"},{"key":"429_CR94","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-50162-3","volume-title":"Multi-level lot sizing and scheduling","author":"A Kimms","year":"1997","unstructured":"Kimms A (1997b) Multi-level lot sizing and scheduling. Physics, Heidelberg"},{"issue":"8","key":"429_CR95","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1016\/S0305-0548(98)00089-6","volume":"26","author":"A Kimms","year":"1999","unstructured":"Kimms A (1999) A genetic algorithm for multi-level, multi-machine lot sizing and scheduling. Comput Oper Res 26(8):829\u2013848","journal-title":"Comput Oper Res"},{"issue":"2","key":"429_CR96","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1002\/(SICI)1097-0037(199809)32:2<85::AID-NET2>3.0.CO;2-E","volume":"32","author":"A Kimms","year":"1998","unstructured":"Kimms A, Drexl A (1998) Proportional lot sizing and scheduling: some extensions. Networks 32(2):85\u2013101","journal-title":"Networks"},{"issue":"1","key":"429_CR97","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s00291-004-0181-7","volume":"27","author":"A Ko\u00e7lar","year":"2005","unstructured":"Ko\u00e7lar A, S\u00fcral H (2005) A note on \u201cThe general lot sizing and scheduling problem\u201d. OR Spectr 27(1):145\u2013146","journal-title":"OR Spectr"},{"issue":"3","key":"429_CR98","doi-asserted-by":"crossref","first-page":"1369","DOI":"10.1021\/ie100790t","volume":"50","author":"GM Kopanos","year":"2011","unstructured":"Kopanos GM, Puigjaner L, Maravelias CT (2011) Production planning and scheduling of parallel continuous processes with product families. Ind Eng Chem Res 50(3):1369\u20131378","journal-title":"Ind Eng Chem Res"},{"issue":"1","key":"429_CR99","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/j.ijpe.2008.08.033","volume":"118","author":"A Kov\u00e1cs","year":"2009","unstructured":"Kov\u00e1cs A, Brown KN, Tarim SA (2009) An efficient MIP model for the capacitated lot-sizing and scheduling problem with sequence-dependent setups. Int J Prod Econ 118(1):282\u2013291","journal-title":"Int J Prod Econ"},{"issue":"24","key":"429_CR100","doi-asserted-by":"crossref","first-page":"7425","DOI":"10.1080\/00207543.2010.543170","volume":"49","author":"I Kwak","year":"2011","unstructured":"Kwak I, Jeong I (2011) A hierarchical approach for the capacitated lot-sizing and scheduling problem with a special structure of sequence-dependent setups. Int J Prod Res 49(24):7425\u20137439","journal-title":"Int J Prod Res"},{"issue":"2","key":"429_CR101","first-page":"125","volume":"31","author":"M Laguna","year":"1999","unstructured":"Laguna M (1999) A heuristic for production scheduling and inventory control in the presence of sequence-dependent setup time. IIE Trans 31(2):125\u2013134","journal-title":"IIE Trans"},{"key":"429_CR102","doi-asserted-by":"crossref","unstructured":"Lang JC (2010) Production and inventory management with substitutions. In: Lecture notes in economics and mathematical systems. Springer, Heidelberg","DOI":"10.1007\/978-3-642-04247-8"},{"issue":"3","key":"429_CR103","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1016\/j.ejor.2011.05.014","volume":"214","author":"JC Lang","year":"2011","unstructured":"Lang JC, Shen ZM (2011) Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions. Eur J Oper Res 214(3):595\u2013605","journal-title":"Eur J Oper Res"},{"issue":"4","key":"429_CR104","doi-asserted-by":"crossref","first-page":"946","DOI":"10.1287\/opre.19.4.946","volume":"19","author":"L Lasdon","year":"1971","unstructured":"Lasdon L, Terjung RC (1971) An efficient algorithm for multi-item scheduling. Oper Res 19(4):946\u2013969","journal-title":"Oper Res"},{"issue":"4","key":"429_CR105","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/inte.15.4.1","volume":"15","author":"M Liberatore","year":"1985","unstructured":"Liberatore M, Miller T (1985) A hierarchical production planning system. Interfaces 15(4):1\u201311","journal-title":"Interfaces"},{"key":"429_CR106","unstructured":"Mac Cawley AF (2014) The international wine supply chain: challenges from bottling to the glass. Ph.D. thesis, Georgia Institute of Technology"},{"issue":"3","key":"429_CR107","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1287\/opre.38.3.456","volume":"38","author":"TL Magnanti","year":"1990","unstructured":"Magnanti TL, Vachani R (1990) A strong cutting plane algorithm for production scheduling with changeover costs. Oper Res 38(3):456\u2013473","journal-title":"Oper Res"},{"issue":"4","key":"429_CR108","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1016\/S1665-6423(14)70080-X","volume":"12","author":"M Maldonado","year":"2014","unstructured":"Maldonado M, Rangel S, Ferreira D (2014) A study of different subsequence elimination strategies for the soft drink production planning. J Appl Res Technol 12(4):631\u2013641","journal-title":"J Appl Res Technol"},{"issue":"1","key":"429_CR109","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s10479-006-0157-x","volume":"150","author":"F Marinelli","year":"2007","unstructured":"Marinelli F, Nenni ME, Sforza A (2007) Capacitated lot sizing and scheduling with parallel machines and shared buffers: a case study in a packaging company. Ann Oper Res 150(1):177\u2013192","journal-title":"Ann Oper Res"},{"issue":"3","key":"429_CR110","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s10951-009-0156-2","volume":"13","author":"GR Mateus","year":"2010","unstructured":"Mateus GR, Ravetti MG, de Souza MC, Valeriano TM (2010) Capacitated lot sizing and sequence dependent setup scheduling: an iterative approach for integration. J Sched 13(3):245\u2013259","journal-title":"J Sched"},{"issue":"2","key":"429_CR111","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/s10951-010-0197-6","volume":"14","author":"AA Menezes","year":"2011","unstructured":"Menezes AA, Clark AR, Almada-Lobo B (2011) Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups. J Sched 14(2):209\u2013219","journal-title":"J Sched"},{"key":"429_CR112","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-89140-2","volume-title":"Simultane Losgr\u00f6\u00dfen- und Reihenfolgeplanung f\u00fcr kontinuierliche Produktionslinien","author":"H Meyr","year":"1999","unstructured":"Meyr H (1999) Simultane Losgr\u00f6\u00dfen- und Reihenfolgeplanung f\u00fcr kontinuierliche Produktionslinien. Deutscher Universit\u00e4tsverlag, Wiesbaden"},{"issue":"2","key":"429_CR113","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0377-2217(99)00159-9","volume":"120","author":"H Meyr","year":"2000","unstructured":"Meyr H (2000) Simultaneous lotsizing and scheduling by combining local search with dual reoptimization. Eur J Oper Res 120(2):311\u2013326","journal-title":"Eur J Oper Res"},{"issue":"2","key":"429_CR114","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0377-2217(01)00373-3","volume":"139","author":"H Meyr","year":"2002","unstructured":"Meyr H (2002) Simultaneous lotsizing and scheduling on parallel machines. Eur J Oper Res 139(2):277\u2013292","journal-title":"Eur J Oper Res"},{"issue":"6","key":"429_CR115","first-page":"585","volume":"74","author":"H Meyr","year":"2004","unstructured":"Meyr H (2004) Simultane Losgr\u00f6\u00dfen- und Reihenfolgeplanung bei mehrstufiger kontinuierlicher Fertigung. Z Betriebswirtschaft 74(6):585\u2013610","journal-title":"Z Betriebswirtschaft"},{"issue":"3","key":"429_CR116","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1016\/j.ejor.2013.03.036","volume":"229","author":"H Meyr","year":"2013","unstructured":"Meyr H, Mann M (2013) A decomposition approach for the general lotsizing and scheduling problem for parallel production lines. Eur J Oper Res 229(3):718\u2013731","journal-title":"Eur J Oper Res"},{"issue":"4","key":"429_CR117","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1287\/opre.51.4.557.16094","volume":"51","author":"AJ Miller","year":"2003","unstructured":"Miller AJ, Wolsey LA (2003) Tight MIP formulations for multi-item discrete lot-sizing problems. Oper Res 51(4):557\u2013565","journal-title":"Oper Res"},{"issue":"9\u201312","key":"429_CR118","doi-asserted-by":"crossref","first-page":"1165","DOI":"10.1007\/s00170-010-2594-6","volume":"50","author":"M Mohammadi","year":"2010","unstructured":"Mohammadi M (2010) Integrating lotsizing, loading, and scheduling decisions in flexible flow shops. Int J Adv Manuf Technol 50(9\u201312):1165\u20131174","journal-title":"Int J Adv Manuf Technol"},{"issue":"6","key":"429_CR119","doi-asserted-by":"crossref","first-page":"7201","DOI":"10.1016\/j.eswa.2010.12.038","volume":"38","author":"M Mohammadi","year":"2011","unstructured":"Mohammadi M, Ghomi SMTF (2011) Genetic algorithm-based heuristic for capacitated lotsizing problem in flow shops with sequence-dependent setups. Expert Syst Appl 38(6):7201\u20137207","journal-title":"Expert Syst Appl"},{"issue":"1","key":"429_CR120","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1080\/0951192X.2010.511654","volume":"24","author":"M Mohammadi","year":"2011","unstructured":"Mohammadi M, Ghomi SMTF, Jafari N (2011) A genetic algorithm for simultaneous lotsizing and sequencing of the permutation flow shops with sequence-dependent setups. Int J Comput Integr Manuf 24(1):87\u201393","journal-title":"Int J Comput Integr Manuf"},{"issue":"10","key":"429_CR121","doi-asserted-by":"crossref","first-page":"2957","DOI":"10.1080\/00207540902796016","volume":"48","author":"M Mohammadi","year":"2010","unstructured":"Mohammadi M, Ghomi SMTF, Karimi B, Torabi SA (2010a) MIP-based heuristics for lotsizing in capacitated pure flow shop with sequence-dependent setups. Int J Prod Res 48(10):2957\u20132973","journal-title":"Int J Prod Res"},{"issue":"4","key":"429_CR122","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/s10845-008-0207-0","volume":"21","author":"M Mohammadi","year":"2010","unstructured":"Mohammadi M, Ghomi SMTF, Karimi B, Torabi SA (2010b) Rolling-horizon and fix-and-relax heuristics for the multi-product multi-level capacitated lotsizing problem with sequence-dependent setups. J Intell Manuf 21(4):501\u2013510","journal-title":"J Intell Manuf"},{"issue":"1\u20134","key":"429_CR123","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s00170-009-2366-3","volume":"49","author":"M Mohammadi","year":"2010","unstructured":"Mohammadi M, Karimi B, Ghomi SMTF, Torabi SA (2010c) A new algorithmic approach for capacitated lot-sizing problem in flow shops with sequence-dependent setups. Int J Adv Manuf Technol 49(1\u20134):201\u2013211","journal-title":"Int J Adv Manuf Technol"},{"issue":"3","key":"429_CR124","doi-asserted-by":"crossref","first-page":"167","DOI":"10.5267\/j.uscm.2014.4.003","volume":"2","author":"M Mohammadi","year":"2014","unstructured":"Mohammadi M, Poursabzi O (2014) A rolling horizon-based heuristic to solve a multi-level general lot sizing and scheduling problem with multiple machines (MLGLSP $$\\_$$ _ MM) in job shop manufacturing system. Uncertain Supply Chain Manag 2(3):167\u2013178","journal-title":"Uncertain Supply Chain Manag"},{"issue":"1","key":"429_CR125","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1299\/jsmec.46.46","volume":"46","author":"K Muramatsu","year":"2003","unstructured":"Muramatsu K, Warman A, Kobayashi M (2003) A near-optimal solution method of multi-item multi-process dynamic lot size scheduling problem. JSME Int J Ser C Mech Syst Mach Elem Manuf 46(1):46\u201353","journal-title":"JSME Int J Ser C Mech Syst Mach Elem Manuf"},{"key":"429_CR126","doi-asserted-by":"crossref","unstructured":"Pahl J, Vo\u00df S (2010) Discrete lot-sizing and scheduling including deterioration and perishability constraints. In: Dangelmaier W, Blecken A, Delius R, Kl\u00f6pfer S (eds) Advanced manufacturing and sustainable logistics, vol 46. Lecture notes in business information processing. Springer, Berlin, pp 345\u2013357","DOI":"10.1007\/978-3-642-12494-5_31"},{"key":"429_CR127","doi-asserted-by":"crossref","unstructured":"Pahl J, Vo\u00df S, Woodruff DL (2011) Discrete lot-sizing and scheduling with sequence-dependent setup times and costs including deterioration and perishability constraints. In: Proceedings of the 44th Hawaii international conference on system sciences. IEEE Computer Society, Los Alamitos, pp 1\u201310","DOI":"10.1109\/HICSS.2011.169"},{"issue":"3","key":"429_CR128","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1080\/00207540310001613656","volume":"42","author":"JA Persson","year":"2004","unstructured":"Persson JA, G\u00f6the-Lundgren M, Lundgren JT, Gendron B (2004) A tabu search heuristic for scheduling the production processes at an oil refinery. Int J Prod Res 42(3):445\u2013471","journal-title":"Int J Prod Res"},{"issue":"1","key":"429_CR129","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1287\/mnsc.37.1.53","volume":"37","author":"Y Pochet","year":"1991","unstructured":"Pochet Y, Wolsey LA (1991) Solving multi-item lot-sizing problems using strong cutting planes. Manag Sci 37(1):53\u201367","journal-title":"Manag Sci"},{"key":"429_CR130","volume-title":"Production planning by mixed integer programming","author":"Y Pochet","year":"2006","unstructured":"Pochet Y, Wolsey LA (2006) Production planning by mixed integer programming. Springer, New York"},{"issue":"11","key":"429_CR131","doi-asserted-by":"crossref","first-page":"2291","DOI":"10.1080\/00207540500066762","volume":"43","author":"D Quadt","year":"2005","unstructured":"Quadt D, Kuhn H (2005) Conceptual framework for lot-sizing and scheduling of flexible flow lines. Int J Prod Res 43(11):2291\u20132308","journal-title":"Int J Prod Res"},{"key":"429_CR132","doi-asserted-by":"crossref","unstructured":"Quadt D, Kuhn H (2008) Capacitated lot-sizing with extensions: a review. 4OR 6(1):61\u201383","DOI":"10.1007\/s10288-007-0057-1"},{"issue":"4","key":"429_CR133","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1002\/nav.20345","volume":"56","author":"D Quadt","year":"2009","unstructured":"Quadt D, Kuhn H (2009) Capacitated lot-sizing and scheduling with parallel machines, back-orders and setup carry-over. Nav Res Logist 56(4):366\u2013384","journal-title":"Nav Res Logist"},{"issue":"2","key":"429_CR134","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1016\/j.jmsy.2013.01.002","volume":"32","author":"R Ramezanian","year":"2013","unstructured":"Ramezanian R, Saidi-Mehrabad M, Fattahi P (2013a) MIP formulation and heuristics for multi-stage capacitated lot-sizing and scheduling problem with availability constraints. J Manuf Syst 32(2):392\u2013401","journal-title":"J Manuf Syst"},{"issue":"1\u20134","key":"429_CR135","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s00170-012-4329-3","volume":"66","author":"R Ramezanian","year":"2013","unstructured":"Ramezanian R, Saidi-Mehrabad M, Teimoury E (2013b) A mathematical model for integrating lot-sizing and scheduling problem in capacitated flow shop environments. Int J Adv Manuf Technol 66(1\u20134):347\u2013361","journal-title":"Int J Adv Manuf Technol"},{"issue":"4","key":"429_CR136","doi-asserted-by":"crossref","first-page":"1250","DOI":"10.1016\/j.cor.2006.07.015","volume":"35","author":"LR Rocha","year":"2008","unstructured":"Rocha LR, Ravetti MG, Meteus GR, Pardalos PM (2008) Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times. Comput Oper Res 35(4):1250\u20131264","journal-title":"Comput Oper Res"},{"issue":"1","key":"429_CR137","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00170-014-6598-5","volume":"78","author":"M Rohaninejad","year":"2015","unstructured":"Rohaninejad M, Kheirkhah A, Fattahi P (2015) Simultaneous lot-sizing and scheduling in flexible job shop problems. Int J Adv Manuf Technol 78(1):1\u201318","journal-title":"Int J Adv Manuf Technol"},{"issue":"3","key":"429_CR138","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1016\/S0377-2217(96)00020-3","volume":"100","author":"M Salomon","year":"1997","unstructured":"Salomon M, Solomon MM, Van Wassenhove LN, Dumas Y, Dauz\u00e8re-P\u00e9r\u00e8s S (1997) Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the traveling salesman problem with time windows. Eur J Oper Res 100(3):494\u2013513","journal-title":"Eur J Oper Res"},{"issue":"1","key":"429_CR139","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cie.2012.01.008","volume":"63","author":"MO Santos","year":"2012","unstructured":"Santos MO, Almada-Lobo B (2012) Integrated pulp and paper mill planning and scheduling. Comput Ind Eng 63(1):1\u201312","journal-title":"Comput Ind Eng"},{"key":"429_CR140","doi-asserted-by":"crossref","unstructured":"Schrage L (1982) The multiproduct lot scheduling problem. In: Dempster M, Lenstra J, Rinnooy Kan A (eds) Deterministic and stochastic scheduling. Kluwer Academic Publishers, Dordrecht, pp 233\u2013244","DOI":"10.1007\/978-94-009-7801-0_13"},{"key":"429_CR141","doi-asserted-by":"crossref","unstructured":"Seeanner F (2013) Multi-stage simultaneous lot-sizing and scheduling\u2014planning of flow lines with shifting bottlenecks. In: Produktion und Logistik, Springer Gabler, Wiesbaden","DOI":"10.1007\/978-3-658-02089-7"},{"issue":"1","key":"429_CR142","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/j.cor.2012.07.002","volume":"40","author":"F Seeanner","year":"2013","unstructured":"Seeanner F, Almada-Lobo B, Meyr H (2013) Combining the principles of variable neighborhood decomposition search and the fix&optimize heuristic to solve multi-level lot-sizing and scheduling problems. Comput Oper Res 40(1):303\u2013317","journal-title":"Comput Oper Res"},{"issue":"1","key":"429_CR143","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s00291-012-0296-1","volume":"35","author":"F Seeanner","year":"2013","unstructured":"Seeanner F, Meyr H (2013) Multi-stage simultaneous lot-sizing and scheduling for flow line production. OR Spectr 35(1):33\u201373","journal-title":"OR Spectr"},{"issue":"4","key":"429_CR144","doi-asserted-by":"crossref","first-page":"920","DOI":"10.1016\/j.cie.2011.06.002","volume":"61","author":"I Shim","year":"2011","unstructured":"Shim I, Kim H, Doh H, Lee D (2011) A two-stage heuristic for single machine capacitated lot-sizing and scheduling with sequence-dependent setup costs. Comput Ind Eng 61(4):920\u2013929","journal-title":"Comput Ind Eng"},{"issue":"4","key":"429_CR145","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1016\/0360-8352(96)00183-0","volume":"30","author":"R Sikora","year":"1996","unstructured":"Sikora R, Chhajed D, Shaw MJ (1996) Integrating the lot-sizing and sequencing decisions for scheduling a capacitated flow line. Comput Ind Eng 30(4):659\u2013679","journal-title":"Comput Ind Eng"},{"issue":"4","key":"429_CR146","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1016\/0360-8352(96)00046-0","volume":"30","author":"RT Sikora","year":"1996","unstructured":"Sikora RT (1996) A genetic algorithm for integrating lot-sizing and sequencing in scheduling a capacitated flow line. Comput Ind Eng 30(4):969\u2013981","journal-title":"Comput Ind Eng"},{"issue":"4","key":"429_CR147","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1080\/00207548808947890","volume":"26","author":"VL Smith-Daniels","year":"1988","unstructured":"Smith-Daniels VL, Ritzman LP (1988) A model for lot sizing and sequencing in process industries. J Prod Res 26(4):647\u2013674","journal-title":"J Prod Res"},{"issue":"3","key":"429_CR148","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1080\/07408178608974705","volume":"18","author":"VL Smith-Daniels","year":"1986","unstructured":"Smith-Daniels VL, Smith-Daniels DE (1986) A mixed integer programming model for lot sizing and sequencing packaging lines in the process industries. IIE Trans 18(3):278\u2013285","journal-title":"IIE Trans"},{"issue":"3","key":"429_CR149","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/j.ejor.2010.09.022","volume":"209","author":"H Stadtler","year":"2011","unstructured":"Stadtler H (2011) Multi-level single machine lot-sizing and scheduling with zero lead times. Eur J Oper Res 209(3):241\u2013252","journal-title":"Eur J Oper Res"},{"issue":"3","key":"429_CR150","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1016\/j.ejor.2012.10.011","volume":"225","author":"H Stadtler","year":"2013","unstructured":"Stadtler H, Sahling F (2013) A lot-sizing and scheduling model for multi-stage flow lines with zero lead times. Eur J Oper Res 225(3):404\u2013419","journal-title":"Eur J Oper Res"},{"issue":"1","key":"429_CR151","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1080\/00207540412331285823","volume":"43","author":"C Suerie","year":"2005","unstructured":"Suerie C (2005) Campaign planning in time-indexed model formulations. Int J Prod Res 43(1):49\u201366","journal-title":"Int J Prod Res"},{"issue":"2","key":"429_CR152","doi-asserted-by":"crossref","first-page":"874","DOI":"10.1016\/j.ejor.2005.03.033","volume":"174","author":"C Suerie","year":"2006","unstructured":"Suerie C (2006) Modeling of period overlapping setup times. Eur J Oper Res 174(2):874\u2013886","journal-title":"Eur J Oper Res"},{"issue":"3","key":"429_CR153","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/j.cie.2008.10.005","volume":"58","author":"W Supithak","year":"2010","unstructured":"Supithak W, Liman SD, Montes EJ (2010) Lot-sizing and scheduling problem with earliness tardiness and setup penalties. Comput Ind Eng 58(3):363\u2013372","journal-title":"Comput Ind Eng"},{"issue":"1","key":"429_CR154","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/j.ijpe.2007.10.001","volume":"113","author":"H Tempelmeier","year":"2008","unstructured":"Tempelmeier H, Buschk\u00fchl L (2008) Dynamic multi-machine lotsizing and sequencing with simultaneous scheduling of a common setup resource. Int J Prod Econ 113(1):401\u2013412","journal-title":"Int J Prod Econ"},{"key":"429_CR155","doi-asserted-by":"publisher","unstructured":"Tempelmeier H, Copil K (2015) Capacitated lot sizing with parallel machines, sequence-dependent setups and a common setup operator. OR Spectr doi: 10.1007\/s00291-015-0410-2","DOI":"10.1007\/s00291-015-0410-2"},{"issue":"2","key":"429_CR156","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1016\/j.ijpe.2012.02.007","volume":"140","author":"L Tiacci","year":"2012","unstructured":"Tiacci L, Saetta S (2012) Demand forecasting, lot sizing and scheduling on a rolling horizon basis. Int J Prod Econ 140(2):803\u2013814","journal-title":"Int J Prod Econ"},{"key":"429_CR157","doi-asserted-by":"crossref","unstructured":"Toledo CFM, Arantes MDS, de Oliveira RRR, Almada-Lobo B (2013) Glass container production scheduling through hybrid multi-population based evolutionary algorithm. Appl Soft Comput 13(3):1352\u20131364","DOI":"10.1016\/j.asoc.2012.03.074"},{"key":"429_CR158","first-page":"1384","volume":"2008","author":"CFM Toledo","year":"2008","unstructured":"Toledo CFM, de Jesus Filho JEF, Fran\u00e7a PM (2008) Meta-heuristic approaches for a soft drink industry problem. IEEE Int Conf Emerg Technol Fact Autom 2008:1384\u20131391","journal-title":"IEEE Int Conf Emerg Technol Fact Autom"},{"issue":"1","key":"429_CR159","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.cor.2014.02.012","volume":"48","author":"CFM Toledo","year":"2014","unstructured":"Toledo CFM, de Oliveira L, de Freitas Pereira R, Fran\u00e7a PM, Morabito R (2014) A genetic algorithm\/mathematical programming approach to solve a two-level soft drink production problem. Comput Oper Res 48(1):40\u201352","journal-title":"Comput Oper Res"},{"key":"429_CR160","doi-asserted-by":"crossref","unstructured":"Toledo CFM, de Oliveira L, de Oliveira RRR, Pereira MR (2010) Parallel genetic algorithm approaches applied to solve a synchronized and integrated lot sizing and scheduling problem. In: Proceedings of the 2010 ACM symposium on applied computing (SAC\u201910). ACM, New York, pp 1148\u20131152","DOI":"10.1145\/1774088.1774330"},{"issue":"11","key":"429_CR161","doi-asserted-by":"crossref","first-page":"3097","DOI":"10.1080\/00207540701675833","volume":"47","author":"CFM Toledo","year":"2009","unstructured":"Toledo CFM, Fran\u00e7a PM, Morabito R, Kimms A (2009) Multi-population genetic algorithm to solve the synchronized and integrated two-level lot sizing and scheduling problem. Int J Prod Res 47(11):3097\u20133119","journal-title":"Int J Prod Res"},{"key":"429_CR162","doi-asserted-by":"crossref","unstructured":"Toledo CFM, Fran\u00e7a PM, Rosa KA (2008) Evaluating genetic algorithms with different population structures on a lot sizing and scheduling problem. In: Proceedings of the 2008 ACM symposium on applied computing (Fortaleza. Ceara, Brazil), pp 1777\u20131781","DOI":"10.1145\/1363686.1364114"},{"key":"429_CR163","unstructured":"Toledo CFM, Kimms A, Fran\u00e7a PM, Morabito R (2006) A mathematical model for the synchronized and integrated two-level lot sizing and scheduling problem. University of Campinas, Brazil"},{"key":"429_CR164","doi-asserted-by":"crossref","unstructured":"Toledo CFM, Kimms A, Fran\u00e7a PM, Morabito R (2015) The synchronized and integrated two-level lot sizing and scheduling problem: evaluating the generalized mathematical model. Math Probl Eng (Article ID 182781)","DOI":"10.1155\/2015\/182781"},{"issue":"3","key":"429_CR165","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1016\/j.cie.2009.02.011","volume":"57","author":"EAV Toso","year":"2009","unstructured":"Toso EAV, Morabito R, Clark AR (2009) Lot sizing and sequencing optimisation at an animal-feed plant. Comput Ind Eng 57(3):813\u2013821","journal-title":"Comput Ind Eng"},{"issue":"9","key":"429_CR166","doi-asserted-by":"crossref","first-page":"2463","DOI":"10.1080\/00207543.2010.532910","volume":"49","author":"S Transchel","year":"2011","unstructured":"Transchel S, Minner S, Kallrath J, L\u00f6hndorf N, Eberhard U (2011) A hybrid general lot-sizing and scheduling formulation for a production process with a two-stage product structure. Int J Prod Res 49(9):2463\u20132480","journal-title":"Int J Prod Res"},{"issue":"52","key":"429_CR167","doi-asserted-by":"crossref","first-page":"5236","DOI":"10.1080\/00207543.2014.902156","volume":"17","author":"EDG Urrutia","year":"2014","unstructured":"Urrutia EDG, Aggoune R, Dauz\u00e8re-P\u00e9r\u00e8res S (2014) Solving the integrated lot-sizing and job-shop scheduling problem. Int J Prod Res 17(52):5236\u20135254","journal-title":"Int J Prod Res"},{"issue":"1","key":"429_CR168","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/S0167-6377(96)00043-0","volume":"20","author":"CA Eijl van","year":"1997","unstructured":"van Eijl CA, van Hoesel CPM (1997) On the discrete lot-sizing and scheduling problem with Wagner\u2013Whitin costs. Oper Res Lett 20(1):7\u201313","journal-title":"Oper Res Lett"},{"issue":"2","key":"429_CR169","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1016\/0377-2217(94)90079-5","volume":"75","author":"S Hoesel van","year":"1994","unstructured":"van Hoesel S, Kolen A (1994) A linear description of the discrete lot-sizing and scheduling problem. Eur J Oper Res 75(2):342\u2013353","journal-title":"Eur J Oper Res"},{"issue":"10","key":"429_CR170","doi-asserted-by":"crossref","first-page":"1409","DOI":"10.1287\/mnsc.44.10.1409","volume":"44","author":"F Vanderbeck","year":"1998","unstructured":"Vanderbeck F (1998) Lot-sizing with start-up times. Manag Sci 44(10):1409\u20131425","journal-title":"Manag Sci"},{"issue":"1","key":"429_CR171","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1287\/mnsc.5.1.89","volume":"5","author":"HM Wagner","year":"1958","unstructured":"Wagner HM, Whitin TM (1958) Dynamic version of the economic lot size model. Manag Sci 5(1):89\u201396","journal-title":"Manag Sci"},{"issue":"1","key":"429_CR172","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.ejor.2015.01.034","volume":"244","author":"C Wolosewicz","year":"2015","unstructured":"Wolosewicz C, Dauz\u00e8re-P\u00e9r\u00e8s S, Aggoune R (2015) A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem. Eur J Oper Res 244(1):3\u201312","journal-title":"Eur J Oper Res"},{"issue":"1","key":"429_CR173","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/S0377-2217(97)89646-4","volume":"99","author":"LA Wolsey","year":"1997","unstructured":"Wolsey LA (1997) MIP modelling of changeovers in production planning and scheduling problems. Eur J Oper Res 99(1):154\u2013165","journal-title":"Eur J Oper Res"},{"issue":"12","key":"429_CR174","doi-asserted-by":"crossref","first-page":"1587","DOI":"10.1287\/mnsc.48.12.1587.442","volume":"48","author":"LA Wolsey","year":"2002","unstructured":"Wolsey LA (2002) Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation. Manag Sci 48(12):1587\u20131602","journal-title":"Manag Sci"},{"key":"429_CR175","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.cor.2015.04.010","volume":"63","author":"J Xiao","year":"2015","unstructured":"Xiao J, Yang H, Zhang C, Zheng L, Gupta JND (2015) A hybrid lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times. Comput Oper Res 63:72\u201382","journal-title":"Comput Oper Res"},{"issue":"16","key":"429_CR176","doi-asserted-by":"crossref","first-page":"5011","DOI":"10.1080\/00207543.2013.790570","volume":"51","author":"J Xiao","year":"2013","unstructured":"Xiao J, Zhang C, Zheng L, Gupta JND (2013) MIP-based fix-and-optimise algorithms for the parallel machine capacitated lot-sizing and scheduling problem. Int J Prod Res 51(16):5011\u20135028","journal-title":"Int J Prod Res"},{"issue":"11","key":"429_CR177","doi-asserted-by":"crossref","first-page":"987","DOI":"10.1080\/07408170600559706","volume":"38","author":"X Zhu","year":"2006","unstructured":"Zhu X, Wilhelm WE (2006) Scheduling and lot sizing with sequence-dependent setup: a literature review. IIE Trans 38(11):987\u20131007","journal-title":"IIE Trans"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-015-0429-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00291-015-0429-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-015-0429-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-015-0429-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T22:32:07Z","timestamp":1654209127000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-015-0429-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,1]]},"references-count":177,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["429"],"URL":"https:\/\/doi.org\/10.1007\/s00291-015-0429-4","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,1]]}}}