{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T20:35:05Z","timestamp":1776976505410,"version":"3.51.4"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031265037","type":"print"},{"value":"9783031265044","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-26504-4_21","type":"book-chapter","created":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T08:02:59Z","timestamp":1677052979000},"page":"290-305","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Mixed-Integer Programming Formulation and\u00a0Heuristics for\u00a0an\u00a0Integrated Production Planning and\u00a0Scheduling Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8600-5598","authenticated-orcid":false,"given":"D. M.","family":"Silva","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7238-0714","authenticated-orcid":false,"given":"G. R.","family":"Mateus","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,23]]},"reference":[{"key":"21_CR1","unstructured":"Araujo, K., Birgin, E., Kawamura, M., Ronconi, D.: Relax-and-fix heuristics applied to a real-world lot-sizing and scheduling problem in the personal care consumer goods industry. arXiv preprint arXiv:2107.10738 (2021)"},{"issue":"10","key":"21_CR2","doi-asserted-by":"publisher","first-page":"1174","DOI":"10.1287\/mnsc.28.10.1174","volume":"28","author":"GR Bitran","year":"1982","unstructured":"Bitran, G.R., Yanasse, H.H.: Computational complexity of the capacitated lot size problem. Manag. Sci. 28(10), 1174\u20131186 (1982)","journal-title":"Manag. Sci."},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Boas, B.E.V., Camargo, V.C., Morabito, R.: Modeling and MIP-heuristics for the general lotsizing and scheduling problem with process configuration selection. Pesquisa Operacional 41 (2021)","DOI":"10.1590\/0101-7438.2021.041s1.00200000"},{"issue":"1","key":"21_CR4","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."},{"key":"21_CR5","volume-title":"An Integrated Approach in Production Planning and Scheduling","author":"S Dauz\u00e8re-P\u00e9res","year":"2012","unstructured":"Dauz\u00e8re-P\u00e9res, S., Lasserre, J.B.: An Integrated Approach in Production Planning and Scheduling, vol. 411. Springer, Heidelberg (2012)"},{"issue":"4","key":"21_CR6","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1007\/s10845-014-1030-4","volume":"28","author":"MM Furlan","year":"2017","unstructured":"Furlan, M.M., Santos, M.O.: BFO: a hybrid bees algorithm for the multi-level capacitated lot-sizing problem. J. Intell. Manuf. 28(4), 929\u2013944 (2017)","journal-title":"J. Intell. Manuf."},{"issue":"4","key":"21_CR7","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1007\/s10489-014-0626-x","volume":"42","author":"HG G\u00f6ren","year":"2015","unstructured":"G\u00f6ren, H.G., Tunal\u0131, S.: Solving the capacitated lot sizing problem with setup carryover using a new sequential hybrid approach. Appl. Intell. 42(4), 805\u2013816 (2015)","journal-title":"Appl. Intell."},{"issue":"2","key":"21_CR8","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/j.rcim.2007.12.002","volume":"25","author":"Y Guo","year":"2009","unstructured":"Guo, Y., Li, W.D., Mileham, A.R., Owen, G.W.: Applications of particle swarm optimisation in integrated process planning and scheduling. Robot. Comput.-Integr. Manuf. 25(2), 280\u2013288 (2009)","journal-title":"Robot. Comput.-Integr. Manuf."},{"issue":"2","key":"21_CR9","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.ijpe.2009.08.022","volume":"123","author":"S Helber","year":"2010","unstructured":"Helber, S., Sahling, F.: A fix-and-optimize approach for the multi-level capacitated lot sizing problem. Int. J. Prod. Econ. 123(2), 247\u2013256 (2010)","journal-title":"Int. J. Prod. Econ."},{"issue":"12","key":"21_CR10","doi-asserted-by":"publisher","first-page":"1816","DOI":"10.1016\/j.cor.2011.02.005","volume":"38","author":"RJ James","year":"2011","unstructured":"James, R.J., Almada-Lobo, B.: Single and parallel machine capacitated lotsizing and scheduling: New iterative MIP-based neighborhood search heuristics. Comput. Oper. Res. 38(12), 1816\u20131825 (2011)","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"21_CR11","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0305-0483(03)00059-8","volume":"31","author":"B Karimi","year":"2003","unstructured":"Karimi, B., Ghomi, S.F., Wilson, J.: The capacitated lot sizing problem: a review of models and algorithms. Omega 31(5), 365\u2013378 (2003)","journal-title":"Omega"},{"issue":"3","key":"21_CR12","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."},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Li, L., Song, S., Wu, C., Wang, R.: Fix-and-optimize and variable neighborhood search approaches for stochastic multi-item capacitated lot-sizing problems. Math. Probl. Eng. 2017 (2017)","DOI":"10.1155\/2017\/7209303"},{"issue":"1\u20132","key":"21_CR14","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0360-8352(99)00023-6","volume":"37","author":"R Linn","year":"1999","unstructured":"Linn, R., Zhang, W.: Hybrid flow shop scheduling: a survey. Comput. Ind. Eng. 37(1\u20132), 57\u201361 (1999)","journal-title":"Comput. Ind. Eng."},{"issue":"12","key":"21_CR15","doi-asserted-by":"publisher","first-page":"1919","DOI":"10.1016\/j.compchemeng.2009.06.007","volume":"33","author":"CT Maravelias","year":"2009","unstructured":"Maravelias, C.T., Sung, C.: Integration of production planning and scheduling: overview, challenges and opportunities. Comput. Chem. Eng. 33(12), 1919\u20131930 (2009)","journal-title":"Comput. Chem. Eng."},{"issue":"3","key":"21_CR16","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10951-009-0156-2","volume":"13","author":"GR Mateus","year":"2010","unstructured":"Mateus, G.R., Ravetti, M.G., de Souza, M.C., Valeriano, T.M.: Capacitated lot sizing and sequence dependent setup scheduling: an iterative approach for integration. J. Sched. 13(3), 245\u2013259 (2010)","journal-title":"J. Sched."},{"key":"21_CR17","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"LP Michael","year":"2008","unstructured":"Michael, L.P.: Scheduling: Theory, Algorithms, and Systems. Springer, Heidelberg (2008)"},{"issue":"3","key":"21_CR18","first-page":"147","volume":"21","author":"M Mohammadi","year":"2010","unstructured":"Mohammadi, M., Fatemi, G.S.: Relax and fix heuristics for simultaneous lot sizing and sequencing the permutation flow shops with sequence-dependent setups. Int. J. Ind. Eng. Prod. Res. 21(3), 147\u2013153 (2010)","journal-title":"Int. J. Ind. Eng. Prod. Res."},{"key":"21_CR19","volume-title":"Applied Statistics and Probability for Engineers","author":"DC Montgomery","year":"2010","unstructured":"Montgomery, D.C., Runger, G.C.: Applied Statistics and Probability for Engineers. Wiley, Hoboken (2010)"},{"key":"21_CR20","volume-title":"Production Planning by Mixed Integer Programming","author":"Y Pochet","year":"2006","unstructured":"Pochet, Y., Wolsey, L.A.: Production Planning by Mixed Integer Programming. Springer, Heidelberg (2006)"},{"key":"21_CR21","unstructured":"Ross, S.M.: Introduction to Probability and Statistics for Engineers and Scientists. Elsevier (2004)"},{"issue":"9","key":"21_CR22","doi-asserted-by":"publisher","first-page":"2546","DOI":"10.1016\/j.cor.2008.10.009","volume":"36","author":"F Sahling","year":"2009","unstructured":"Sahling, F., Buschk\u00fchl, L., Tempelmeier, H., Helber, S.: Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic. Comput. Oper. Res. 36(9), 2546\u20132553 (2009)","journal-title":"Comput. Oper. Res."},{"key":"21_CR23","unstructured":"Saravia, K.L.L.: Modelos e algoritmos para o flowshop h\u00edbrido com tempos de prepara\u00e7\u00e3o dependentes da sequ\u00eancia e da m\u00e1quina. Master\u2019s thesis, Universidade Federal de Minas Gerais (2016)"},{"issue":"03","key":"21_CR24","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1109\/TLA.2019.8863314","volume":"17","author":"TMP Schimidt","year":"2019","unstructured":"Schimidt, T.M.P., Tadeu, S.C., Loch, G.V., Schenekemberg, C.M.: Heuristic approaches to solve a two-stage lot sizing and scheduling problem. IEEE Lat. Am. Trans. 17(03), 434\u2013443 (2019)","journal-title":"IEEE Lat. Am. Trans."},{"key":"21_CR25","doi-asserted-by":"crossref","unstructured":"Toledo, C.F.M., da Silva Arantes, M., Hossomi, M.Y.B., Fran\u00e7a, P.M., Akartunal\u0131, K.: A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems. J. Heuristics 21(5), 687\u2013717 (2015)","DOI":"10.1007\/s10732-015-9295-0"}],"container-title":["Lecture Notes in Computer Science","Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-26504-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T08:04:23Z","timestamp":1688198663000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26504-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031265037","9783031265044"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26504-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"23 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Metaheuristics International Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ortigia-Syracuse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"metic2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ants-lab.it\/mic2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"72","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"67% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}