{"title":"基于改进NSGA-III算法的多目标流水车间调度问题研究","authors":"Xi Zhang, Yuxing Wang","doi":"10.1145/3501409.3501618","DOIUrl":null,"url":null,"abstract":"Under the background of intelligence, this paper studies the actual workshop scheduling problem of the impeller company. From the perspective of reducing carbon emissions, combining the makespan and total operating cost of the machine as optimization indexes, a multi-objective mathematical model is established. Meanwhile, an improved NSGA-III algorithm was designed to solve the model. Compared with the experimental results of the genetic simulated annealing algorithm, better results were obtained in the three aspects of minimizing carbon emissions, minimizing total operating cost, and shortest completion time, to obtain the optimal scheduling scheme.","PeriodicalId":191106,"journal":{"name":"Proceedings of the 2021 5th International Conference on Electronic Information Technology and Computer Engineering","volume":"5 7","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Research on multi-objective flow shop scheduling problem based on improved NSGA-III algorithm\",\"authors\":\"Xi Zhang, Yuxing Wang\",\"doi\":\"10.1145/3501409.3501618\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Under the background of intelligence, this paper studies the actual workshop scheduling problem of the impeller company. From the perspective of reducing carbon emissions, combining the makespan and total operating cost of the machine as optimization indexes, a multi-objective mathematical model is established. Meanwhile, an improved NSGA-III algorithm was designed to solve the model. Compared with the experimental results of the genetic simulated annealing algorithm, better results were obtained in the three aspects of minimizing carbon emissions, minimizing total operating cost, and shortest completion time, to obtain the optimal scheduling scheme.\",\"PeriodicalId\":191106,\"journal\":{\"name\":\"Proceedings of the 2021 5th International Conference on Electronic Information Technology and Computer Engineering\",\"volume\":\"5 7\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-10-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2021 5th International Conference on Electronic Information Technology and Computer Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3501409.3501618\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2021 5th International Conference on Electronic Information Technology and Computer Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3501409.3501618","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Research on multi-objective flow shop scheduling problem based on improved NSGA-III algorithm
Under the background of intelligence, this paper studies the actual workshop scheduling problem of the impeller company. From the perspective of reducing carbon emissions, combining the makespan and total operating cost of the machine as optimization indexes, a multi-objective mathematical model is established. Meanwhile, an improved NSGA-III algorithm was designed to solve the model. Compared with the experimental results of the genetic simulated annealing algorithm, better results were obtained in the three aspects of minimizing carbon emissions, minimizing total operating cost, and shortest completion time, to obtain the optimal scheduling scheme.