Jinli Liu , Yuyan Han , Yuting Wang , Yiping Liu , Biao Zhang
{"title":"交付时间窗口下具有一致子批次的分布式混合流水车间调度：罚分批次辅助迭代贪婪算法","authors":"Jinli Liu , Yuyan Han , Yuting Wang , Yiping Liu , Biao Zhang","doi":"10.1016/j.eij.2024.100566","DOIUrl":null,"url":null,"abstract":"<div><div>Integrating the delivery time windows into the distributed hybrid flow shop scheduling contributes to ensuring the timely delivery of products and enhancing customer satisfaction. In view of this, this study focuses on distributed hybrid flowshop scheduling with consistent sublots under the delivery time windows constraint, denoted as <span><math><mrow><mi>DH</mi><msub><mi>F</mi><mi>m</mi></msub><mrow><mo>|</mo><msub><mrow><mi>lot</mi></mrow><mrow><mi>cs</mi></mrow></msub><mo>|</mo></mrow><mi>ε</mi><mrow><mfenced><mrow><mi>T</mi><mi>W</mi><mi>E</mi><mi>T</mi><mo>/</mo><mi>D</mi><mi>T</mi><mi>W</mi></mrow></mfenced></mrow></mrow></math></span>. However, there exist some challenges of problem model modeling and algorithmic design for the problem to be addressed. Therefore, we first construct a mixed integer linear programming (MILP) model tailored to <span><math><mrow><mi>DH</mi><msub><mi>F</mi><mi>m</mi></msub><mrow><mo>|</mo><msub><mrow><mi>lot</mi></mrow><mrow><mi>cs</mi></mrow></msub><mo>|</mo></mrow><mi>ε</mi><mrow><mfenced><mrow><mi>T</mi><mi>W</mi><mi>E</mi><mi>T</mi><mo>/</mo><mi>D</mi><mi>T</mi><mi>W</mi></mrow></mfenced></mrow></mrow></math></span> with the aim of minimizing the total weighted earliness and tardiness (<span><math><mrow><mi>TWET</mi></mrow></math></span>). Additionally, we introduce a penalty lot-assisted iterated greedy (<span><math><mrow><mi>P</mi><mi>L</mi><mi>_</mi><mi>I</mi><mi>G</mi><mi>_</mi><mi>I</mi><mi>T</mi><mi>I</mi></mrow></math></span>) and idle time insertion to coincide better with delivery time windows, in which a delivery-time-based multi-rule NEH, an adaptive insertion-based reconstruction based on the changing of the delivery status, a trilaminar penalty lot-assisted local search, and an elitist list-based acceptance criterion are designed to save convergence time and reduce the late deliveries attempts. Lastly, we also introduce a completely new method to generate delivery time windows and create 400 distinct instances. Based on the average results from five runs of 400 instances, <span><math><mrow><mi>P</mi><mi>L</mi><mi>_</mi><mi>I</mi><mi>G</mi><mi>_</mi><mi>I</mi><mi>T</mi><mi>I</mi></mrow></math></span> demonstrates improvements of 59.0 %, 72.3 %, 76.9 %, and 25.5 % compared to <span><math><mrow><mi>HIGT</mi></mrow></math></span>, <span><math><mrow><mi>DABC</mi></mrow></math></span>, <span><math><mrow><mi>CVND</mi></mrow></math></span>, and <span><math><mrow><mi>I</mi><mi>G</mi><mi>_</mi><mi>M</mi><mi>R</mi></mrow></math></span>, respectively. When considering the minimum values from each instance, <span><math><mrow><mi>P</mi><mi>L</mi><mi>_</mi><mi>I</mi><mi>G</mi><mi>_</mi><mi>I</mi><mi>T</mi><mi>I</mi></mrow></math></span> exhibits enhancements of 59.4 %, 71.8 %, 74.9 %, and 25.4 % over <span><math><mrow><mi>HIGT</mi></mrow></math></span>, <span><math><mrow><mi>DABC</mi></mrow></math></span>, <span><math><mrow><mi>CVND</mi></mrow></math></span>, and <span><math><mrow><mi>I</mi><mi>G</mi><mi>_</mi><mi>M</mi><mi>R</mi></mrow></math></span>, respectively, it evident that <span><math><mrow><mi>P</mi><mi>L</mi><mi>_</mi><mi>I</mi><mi>G</mi><mi>_</mi><mi>I</mi><mi>T</mi><mi>I</mi></mrow></math></span> can effectively solve <span><math><mrow><mi>DH</mi><msub><mi>F</mi><mi>m</mi></msub><mrow><mo>|</mo><msub><mrow><mi>lot</mi></mrow><mrow><mi>cs</mi></mrow></msub><mo>|</mo></mrow><mi>ε</mi><mrow><mfenced><mrow><mi>T</mi><mi>W</mi><mi>E</mi><mi>T</mi><mo>/</mo><mi>D</mi><mi>T</mi><mi>W</mi></mrow></mfenced></mrow></mrow></math></span>.</div></div>","PeriodicalId":56010,"journal":{"name":"Egyptian Informatics Journal","volume":"28 ","pages":"Article 100566"},"PeriodicalIF":5.0000,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Distributed hybrid flowshop scheduling with consistent sublots under delivery time windows: A penalty lot-assisted iterated greedy algorithm\",\"authors\":\"Jinli Liu , Yuyan Han , Yuting Wang , Yiping Liu , Biao Zhang\",\"doi\":\"10.1016/j.eij.2024.100566\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Integrating the delivery time windows into the distributed hybrid flow shop scheduling contributes to ensuring the timely delivery of products and enhancing customer satisfaction. In view of this, this study focuses on distributed hybrid flowshop scheduling with consistent sublots under the delivery time windows constraint, denoted as <span><math><mrow><mi>DH</mi><msub><mi>F</mi><mi>m</mi></msub><mrow><mo>|</mo><msub><mrow><mi>lot</mi></mrow><mrow><mi>cs</mi></mrow></msub><mo>|</mo></mrow><mi>ε</mi><mrow><mfenced><mrow><mi>T</mi><mi>W</mi><mi>E</mi><mi>T</mi><mo>/</mo><mi>D</mi><mi>T</mi><mi>W</mi></mrow></mfenced></mrow></mrow></math></span>. However, there exist some challenges of problem model modeling and algorithmic design for the problem to be addressed. Therefore, we first construct a mixed integer linear programming (MILP) model tailored to <span><math><mrow><mi>DH</mi><msub><mi>F</mi><mi>m</mi></msub><mrow><mo>|</mo><msub><mrow><mi>lot</mi></mrow><mrow><mi>cs</mi></mrow></msub><mo>|</mo></mrow><mi>ε</mi><mrow><mfenced><mrow><mi>T</mi><mi>W</mi><mi>E</mi><mi>T</mi><mo>/</mo><mi>D</mi><mi>T</mi><mi>W</mi></mrow></mfenced></mrow></mrow></math></span> with the aim of minimizing the total weighted earliness and tardiness (<span><math><mrow><mi>TWET</mi></mrow></math></span>). Additionally, we introduce a penalty lot-assisted iterated greedy (<span><math><mrow><mi>P</mi><mi>L</mi><mi>_</mi><mi>I</mi><mi>G</mi><mi>_</mi><mi>I</mi><mi>T</mi><mi>I</mi></mrow></math></span>) and idle time insertion to coincide better with delivery time windows, in which a delivery-time-based multi-rule NEH, an adaptive insertion-based reconstruction based on the changing of the delivery status, a trilaminar penalty lot-assisted local search, and an elitist list-based acceptance criterion are designed to save convergence time and reduce the late deliveries attempts. Lastly, we also introduce a completely new method to generate delivery time windows and create 400 distinct instances. Based on the average results from five runs of 400 instances, <span><math><mrow><mi>P</mi><mi>L</mi><mi>_</mi><mi>I</mi><mi>G</mi><mi>_</mi><mi>I</mi><mi>T</mi><mi>I</mi></mrow></math></span> demonstrates improvements of 59.0 %, 72.3 %, 76.9 %, and 25.5 % compared to <span><math><mrow><mi>HIGT</mi></mrow></math></span>, <span><math><mrow><mi>DABC</mi></mrow></math></span>, <span><math><mrow><mi>CVND</mi></mrow></math></span>, and <span><math><mrow><mi>I</mi><mi>G</mi><mi>_</mi><mi>M</mi><mi>R</mi></mrow></math></span>, respectively. When considering the minimum values from each instance, <span><math><mrow><mi>P</mi><mi>L</mi><mi>_</mi><mi>I</mi><mi>G</mi><mi>_</mi><mi>I</mi><mi>T</mi><mi>I</mi></mrow></math></span> exhibits enhancements of 59.4 %, 71.8 %, 74.9 %, and 25.4 % over <span><math><mrow><mi>HIGT</mi></mrow></math></span>, <span><math><mrow><mi>DABC</mi></mrow></math></span>, <span><math><mrow><mi>CVND</mi></mrow></math></span>, and <span><math><mrow><mi>I</mi><mi>G</mi><mi>_</mi><mi>M</mi><mi>R</mi></mrow></math></span>, respectively, it evident that <span><math><mrow><mi>P</mi><mi>L</mi><mi>_</mi><mi>I</mi><mi>G</mi><mi>_</mi><mi>I</mi><mi>T</mi><mi>I</mi></mrow></math></span> can effectively solve <span><math><mrow><mi>DH</mi><msub><mi>F</mi><mi>m</mi></msub><mrow><mo>|</mo><msub><mrow><mi>lot</mi></mrow><mrow><mi>cs</mi></mrow></msub><mo>|</mo></mrow><mi>ε</mi><mrow><mfenced><mrow><mi>T</mi><mi>W</mi><mi>E</mi><mi>T</mi><mo>/</mo><mi>D</mi><mi>T</mi><mi>W</mi></mrow></mfenced></mrow></mrow></math></span>.</div></div>\",\"PeriodicalId\":56010,\"journal\":{\"name\":\"Egyptian Informatics Journal\",\"volume\":\"28 \",\"pages\":\"Article 100566\"},\"PeriodicalIF\":5.0000,\"publicationDate\":\"2024-11-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Egyptian Informatics Journal\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1110866524001294\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Egyptian Informatics Journal","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1110866524001294","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
Distributed hybrid flowshop scheduling with consistent sublots under delivery time windows: A penalty lot-assisted iterated greedy algorithm
Integrating the delivery time windows into the distributed hybrid flow shop scheduling contributes to ensuring the timely delivery of products and enhancing customer satisfaction. In view of this, this study focuses on distributed hybrid flowshop scheduling with consistent sublots under the delivery time windows constraint, denoted as . However, there exist some challenges of problem model modeling and algorithmic design for the problem to be addressed. Therefore, we first construct a mixed integer linear programming (MILP) model tailored to with the aim of minimizing the total weighted earliness and tardiness (). Additionally, we introduce a penalty lot-assisted iterated greedy () and idle time insertion to coincide better with delivery time windows, in which a delivery-time-based multi-rule NEH, an adaptive insertion-based reconstruction based on the changing of the delivery status, a trilaminar penalty lot-assisted local search, and an elitist list-based acceptance criterion are designed to save convergence time and reduce the late deliveries attempts. Lastly, we also introduce a completely new method to generate delivery time windows and create 400 distinct instances. Based on the average results from five runs of 400 instances, demonstrates improvements of 59.0 %, 72.3 %, 76.9 %, and 25.5 % compared to , , , and , respectively. When considering the minimum values from each instance, exhibits enhancements of 59.4 %, 71.8 %, 74.9 %, and 25.4 % over , , , and , respectively, it evident that can effectively solve .
期刊介绍：
The Egyptian Informatics Journal is published by the Faculty of Computers and Artificial Intelligence, Cairo University. This Journal provides a forum for the state-of-the-art research and development in the fields of computing, including computer sciences, information technologies, information systems, operations research and decision support. Innovative and not-previously-published work in subjects covered by the Journal is encouraged to be submitted, whether from academic, research or commercial sources.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
