{"title":"ACO-based Parallel Machine Scheduling Considering Both Setup Time and Run-based Preventive Maintenance with Reliability Constraints","authors":"Siqi Chen, Liya Wang","doi":"10.1109/IEEM.2018.8607602","DOIUrl":null,"url":null,"abstract":"This paper studied the problem of parallel processing machine scheduling, taking both set up time and run-based preventive maintenance with reliability constraints into consideration. The objective is to minimize makespan. For this NP-hard problem, an Ant Colony Optimization (ACO) algorithm is proposed. The node selecting probability equation is set based on characteristics of this problem. The objective value obtained by the proposed algorithm is compared to that of the classical LPT rule through numerical experiments. The experiment results imply that the proposed ACO algorithm has better performance than the LPT rule.","PeriodicalId":119238,"journal":{"name":"2018 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IEEM.2018.8607602","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
This paper studied the problem of parallel processing machine scheduling, taking both set up time and run-based preventive maintenance with reliability constraints into consideration. The objective is to minimize makespan. For this NP-hard problem, an Ant Colony Optimization (ACO) algorithm is proposed. The node selecting probability equation is set based on characteristics of this problem. The objective value obtained by the proposed algorithm is compared to that of the classical LPT rule through numerical experiments. The experiment results imply that the proposed ACO algorithm has better performance than the LPT rule.
IF 6.3 4区 医学Systematic ReviewsPub Date : 2022-10-26DOI: 10.1186/s13643-022-02099-9
Alexandria Bennett, Andrew Beck, Nicole Shaver, Roland Grad, Allana LeBlanc, Heather Limburg, Casey Gray, Ahmed Abou-Setta, Scott Klarenbach, Navindra Persaud, Guylène Thériault, Brett D Thombs, Keith J Todd, Neil Bell, Philipp Dahm, Andrew Loblaw, Lisa Del Giudice, Xiaomei Yao, Becky Skidmore, Elizabeth Rolland-Harris, Melissa Brouwers, Julian Little, David Moher
IF 0 medRxiv - OncologyPub Date : 2024-05-31DOI: 10.1101/2024.05.29.24308154
Alexandria Bennett, Nicole Shaver, Niyati Vyas, Faris Almoli, Robert Pap, Andrea Douglas, Taddele Kibret, Becky Skidmore, Martin Yaffe, Anna Wilkinson, Jean M. Seely, Julian Little, David Moher