Burcu Beykal, Styliani Avraamidou, Efstratios N Pistikopoulos
{"title":"综合规划调度问题的双级混合整数数据驱动优化。","authors":"Burcu Beykal, Styliani Avraamidou, Efstratios N Pistikopoulos","doi":"10.1016/b978-0-323-88506-5.50265-5","DOIUrl":null,"url":null,"abstract":"<p><p>Supply chain management is an interconnected problem that requires the coordination of various decisions and elements across long-term (i.e., supply chain structure), medium-term (i.e., production planning), and short-term (i.e., production scheduling) operations. Traditionally, decision-making strategies for such problems follow a sequential approach where longer-term decisions are made first and implemented at lower levels, accordingly. However, there are shared variables across different decision layers of the supply chain that are dictating the feasibility and optimality of the overall supply chain performance. Multi-level programming offers a holistic approach that explicitly accounts for this inherent hierarchy and interconnectivity between supply chain elements, however, requires more rigorous solution strategies as they are strongly NP-hard. In this work, we use the DOMINO framework, a data-driven optimization algorithm initially developed to solve single-leader single-follower bi-level mixed-integer optimization problems, and further develop it to address integrated planning and scheduling formulations with multiple follower lower-level problems, which has not received extensive attention in the open literature. By sampling for the production targets over a pre-specified planning horizon, DOMINO deterministically solves the scheduling problem at each planning period per sample, while accounting for the total cost of planning, inventories, and demand satisfaction. This input-output data is then passed onto a data-driven optimizer to recover a guaranteed feasible, near-optimal solution to the integrated planning and scheduling problem. We show the applicability of the proposed approach for the solution of a two-product planning and scheduling case study.</p>","PeriodicalId":72950,"journal":{"name":"ESCAPE. European Symposium on Computer Aided Process Engineering","volume":"50 ","pages":"1707-1713"},"PeriodicalIF":0.0000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8370828/pdf/nihms-1727734.pdf","citationCount":"3","resultStr":"{\"title\":\"Bi-level Mixed-Integer Data-Driven Optimization of Integrated Planning and Scheduling Problems.\",\"authors\":\"Burcu Beykal, Styliani Avraamidou, Efstratios N Pistikopoulos\",\"doi\":\"10.1016/b978-0-323-88506-5.50265-5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>Supply chain management is an interconnected problem that requires the coordination of various decisions and elements across long-term (i.e., supply chain structure), medium-term (i.e., production planning), and short-term (i.e., production scheduling) operations. Traditionally, decision-making strategies for such problems follow a sequential approach where longer-term decisions are made first and implemented at lower levels, accordingly. However, there are shared variables across different decision layers of the supply chain that are dictating the feasibility and optimality of the overall supply chain performance. Multi-level programming offers a holistic approach that explicitly accounts for this inherent hierarchy and interconnectivity between supply chain elements, however, requires more rigorous solution strategies as they are strongly NP-hard. In this work, we use the DOMINO framework, a data-driven optimization algorithm initially developed to solve single-leader single-follower bi-level mixed-integer optimization problems, and further develop it to address integrated planning and scheduling formulations with multiple follower lower-level problems, which has not received extensive attention in the open literature. By sampling for the production targets over a pre-specified planning horizon, DOMINO deterministically solves the scheduling problem at each planning period per sample, while accounting for the total cost of planning, inventories, and demand satisfaction. This input-output data is then passed onto a data-driven optimizer to recover a guaranteed feasible, near-optimal solution to the integrated planning and scheduling problem. We show the applicability of the proposed approach for the solution of a two-product planning and scheduling case study.</p>\",\"PeriodicalId\":72950,\"journal\":{\"name\":\"ESCAPE. European Symposium on Computer Aided Process Engineering\",\"volume\":\"50 \",\"pages\":\"1707-1713\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8370828/pdf/nihms-1727734.pdf\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ESCAPE. European Symposium on Computer Aided Process Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1016/b978-0-323-88506-5.50265-5\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2021/7/18 0:00:00\",\"PubModel\":\"Epub\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ESCAPE. European Symposium on Computer Aided Process Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1016/b978-0-323-88506-5.50265-5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2021/7/18 0:00:00","PubModel":"Epub","JCR":"","JCRName":"","Score":null,"Total":0}
Bi-level Mixed-Integer Data-Driven Optimization of Integrated Planning and Scheduling Problems.
Supply chain management is an interconnected problem that requires the coordination of various decisions and elements across long-term (i.e., supply chain structure), medium-term (i.e., production planning), and short-term (i.e., production scheduling) operations. Traditionally, decision-making strategies for such problems follow a sequential approach where longer-term decisions are made first and implemented at lower levels, accordingly. However, there are shared variables across different decision layers of the supply chain that are dictating the feasibility and optimality of the overall supply chain performance. Multi-level programming offers a holistic approach that explicitly accounts for this inherent hierarchy and interconnectivity between supply chain elements, however, requires more rigorous solution strategies as they are strongly NP-hard. In this work, we use the DOMINO framework, a data-driven optimization algorithm initially developed to solve single-leader single-follower bi-level mixed-integer optimization problems, and further develop it to address integrated planning and scheduling formulations with multiple follower lower-level problems, which has not received extensive attention in the open literature. By sampling for the production targets over a pre-specified planning horizon, DOMINO deterministically solves the scheduling problem at each planning period per sample, while accounting for the total cost of planning, inventories, and demand satisfaction. This input-output data is then passed onto a data-driven optimizer to recover a guaranteed feasible, near-optimal solution to the integrated planning and scheduling problem. We show the applicability of the proposed approach for the solution of a two-product planning and scheduling case study.