{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T00:18:39Z","timestamp":1783037919804,"version":"3.54.6"},"publisher-location":"Singapore","reference-count":17,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819699001","type":"print"},{"value":"9789819699018","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-9901-8_17","type":"book-chapter","created":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T07:58:46Z","timestamp":1753257526000},"page":"208-218","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Improved Column Generation Algorithm for the Capacitated Lot Sizing Problem with Wastewater Discharge Limitations"],"prefix":"10.1007","author":[{"given":"Zheng","family":"Zhou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bin","family":"Qian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rong","family":"Hu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nai-kang","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,7,24]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/BF02248584","volume":"26","author":"WH Chen","year":"1990","unstructured":"Chen, W.H., Thizy, J.M.: Analysis of relaxations for the multi-item capacitated lot-sizing problem. Ann. Oper. Res. 26, 29\u201372 (1990)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"17_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10732-024-09539-w","volume":"31","author":"WAO Soler","year":"2025","unstructured":"Soler, W.A.O., Santos, M.O., Akartunal\u0131, K.: Lagrangian-based heuristics for production planning with perishable products, scarce resources, and sequence-dependent setup times. J. Heuristics 31(1), 1\u201335 (2025)","journal-title":"J. Heuristics"},{"issue":"3","key":"17_CR3","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1016\/j.ejor.2020.01.016","volume":"284","author":"Y\u00c1 R\u00edos-Sol\u00eds","year":"2020","unstructured":"R\u00edos-Sol\u00eds, Y.\u00c1., Ibarra-Rojas, O.J., Cabo, M., Possani, E.: A heuristic based on mathematical programming for a lot-sizing and scheduling problem in mold-injection production. Eur. J. Oper. Res. 284(3), 861\u2013873 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"17_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2019.106115","volume":"138","author":"W Qin","year":"2019","unstructured":"Qin, W., Zhuang, Z., Liu, Y., Tang, O.: A two-stage ant colony algorithm for hybrid flow shop scheduling with lot sizing and calendar constraints in printed circuit board assembly. Comput. Ind. Eng. 138, 106115 (2019)","journal-title":"Comput. Ind. Eng."},{"key":"17_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2020.102205","volume":"100","author":"HC Hwang","year":"2021","unstructured":"Hwang, H.C., Kang, J.: An improved algorithm for the lot-sizing problem with outbound shipment. Omega 100, 102205 (2021)","journal-title":"Omega"},{"issue":"13","key":"17_CR6","doi-asserted-by":"publisher","first-page":"4645","DOI":"10.1080\/00207543.2023.2270076","volume":"62","author":"H Qin","year":"2024","unstructured":"Qin, H., Zhuang, H., Yu, C., Li, J.: A matheuristic approach for the multi-level capacitated lot-sizing problem with substitution and backorder. Int. J. Prod. Res. 62(13), 4645\u20134673 (2024)","journal-title":"Int. J. Prod. Res."},{"issue":"4","key":"17_CR7","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1287\/opre.1050.0223","volume":"53","author":"A Atamt\u00fcrk","year":"2005","unstructured":"Atamt\u00fcrk, A., K\u00fc\u00e7\u00fckyavuz, S.: Lot sizing with inventory bounds and fixed costs: Polyhedral study and computation. Oper. Res. 53(4), 711\u2013730 (2005)","journal-title":"Oper. Res."},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.cor.2018.05.024","volume":"98","author":"T Wu","year":"2018","unstructured":"Wu, T., Xiao, F., Zhang, C., He, Y., Liang, Z.: The green capacitated multi-item lot sizing problem with parallel machines. Comput. Oper. Res. 98, 149\u2013164 (2018)","journal-title":"Comput. Oper. Res."},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2018.03.006","volume":"96","author":"F Hein","year":"2018","unstructured":"Hein, F., Almeder, C., Figueira, G., Almada-Lobo, B.: Designing new heuristics for the capacitated lot sizing problem by genetic programming. Comput. Oper. Res. 96, 1\u201314 (2018)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"17_CR10","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/j.ejor.2011.05.014","volume":"214","author":"JC Lang","year":"2011","unstructured":"Lang, J.C., Shen, Z.J.M.: Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions. Eur. J. Oper. Res. 214(3), 595\u2013605 (2011)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"17_CR11","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.ejor.2021.03.050","volume":"296","author":"DM Carvalho","year":"2022","unstructured":"Carvalho, D.M., Nascimento, M.C.: Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup. Eur. J. Oper. Res. 296(1), 158\u2013173 (2022)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"17_CR12","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1287\/ijoc.2016.0691","volume":"28","author":"I Fragkos","year":"2016","unstructured":"Fragkos, I., Degraeve, Z., De Reyck, B.: A horizon decomposition approach for the capacitated lot-sizing problem with setup times. INFORMS J. Comput. 28(3), 465\u2013482 (2016)","journal-title":"INFORMS J. Comput."},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.cor.2015.04.015","volume":"63","author":"DJ Fiorotto","year":"2015","unstructured":"Fiorotto, D.J., de Araujo, S.A., Jans, R.: Hybrid methods for lot sizing on parallel machines. Comput. Oper. Res. 63, 136\u2013148 (2015)","journal-title":"Comput. Oper. Res."},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Tempelmeier, H.: A column generation heuristic for dynamic capacitated lot sizing with random demand under a fillrate constraint. In: 2010 IEEE Int. Conf. Ind. Eng. Eng. Manag., pp. 1246\u20131250 (2010)","DOI":"10.1109\/IEEM.2010.5674367"},{"issue":"1","key":"17_CR15","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1287\/mnsc.5.1.89","volume":"5","author":"HM Wagner","year":"1958","unstructured":"Wagner, H.M., Whitin, T.M.: Dynamic version of the economic lot size model. Manag. Sci. 5(1), 89\u201396 (1958)","journal-title":"Manag. Sci."},{"issue":"17","key":"17_CR16","doi-asserted-by":"publisher","first-page":"5181","DOI":"10.1080\/00207540903179782","volume":"48","author":"H Tempelmeier","year":"2010","unstructured":"Tempelmeier, H., Herpers, S.: ABC \u03b2\u2013a heuristic for dynamic capacitated lot sizing with random demand under a fill rate constraint. Int. J. Prod. Res. 48(17), 5181\u20135193 (2010)","journal-title":"Int. J. Prod. Res."},{"key":"17_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2023.108958","volume":"263","author":"M Rohaninejad","year":"2023","unstructured":"Rohaninejad, M., Hanz\u00e1lek, Z.: Multi-level lot-sizing and job shop scheduling with lot-streaming: Reformulation and solution approaches. Int. J. Prod. Econ. 263, 108958 (2023)","journal-title":"Int. J. Prod. Econ."}],"container-title":["Lecture Notes in Computer Science","Advanced Intelligent Computing Technology and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-9901-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T23:47:43Z","timestamp":1783036063000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-9901-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819699001","9789819699018"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-9901-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"24 July 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ningbo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ic-icc.cn\/icg\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}