Safanah Faisal Yousif, F. Ali, Karrar Fatah Alshaikhli
{"title":"使用局部搜索方法解决两个多标准机器调度问题","authors":"Safanah Faisal Yousif, F. Ali, Karrar Fatah Alshaikhli","doi":"10.23851/mjs.v34i4.1430","DOIUrl":null,"url":null,"abstract":"In this paper, we have improved solutions for two of the Multi-Criteria Machine Scheduling Problems (MCMSP). These problems are to maximize early jobs time and range of lateness jobs times (1//(E_max,R_L ), and the second problem is maximum tardy jobs time and range of lateness jobs times (1//(T_max,R_L ) in a single machine with Multi-Objective Machine Scheduling Problems (MOMSP) 1//(E_max+R_L ) and 1//(T_max+R_L ) which are derived from the main problems respectively. The Local Search Methods (LSMs), Bees Algorithm (BA), and a Simulated Annealing (SA) are applied to solve all suggested problems. Finally, the experimental results of the LSMs are compared with the results of the Branch and Bound (BAB) method for a reasonable time. These results are ensuring the efficiency of LSMs.","PeriodicalId":7867,"journal":{"name":"Al-Mustansiriyah Journal of Science","volume":" 17","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Using Local Search Methods for Solving Two Multi-Criteria Machine Scheduling Problems\",\"authors\":\"Safanah Faisal Yousif, F. Ali, Karrar Fatah Alshaikhli\",\"doi\":\"10.23851/mjs.v34i4.1430\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we have improved solutions for two of the Multi-Criteria Machine Scheduling Problems (MCMSP). These problems are to maximize early jobs time and range of lateness jobs times (1//(E_max,R_L ), and the second problem is maximum tardy jobs time and range of lateness jobs times (1//(T_max,R_L ) in a single machine with Multi-Objective Machine Scheduling Problems (MOMSP) 1//(E_max+R_L ) and 1//(T_max+R_L ) which are derived from the main problems respectively. The Local Search Methods (LSMs), Bees Algorithm (BA), and a Simulated Annealing (SA) are applied to solve all suggested problems. Finally, the experimental results of the LSMs are compared with the results of the Branch and Bound (BAB) method for a reasonable time. These results are ensuring the efficiency of LSMs.\",\"PeriodicalId\":7867,\"journal\":{\"name\":\"Al-Mustansiriyah Journal of Science\",\"volume\":\" 17\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-12-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Al-Mustansiriyah Journal of Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23851/mjs.v34i4.1430\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Al-Mustansiriyah Journal of Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23851/mjs.v34i4.1430","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Using Local Search Methods for Solving Two Multi-Criteria Machine Scheduling Problems
In this paper, we have improved solutions for two of the Multi-Criteria Machine Scheduling Problems (MCMSP). These problems are to maximize early jobs time and range of lateness jobs times (1//(E_max,R_L ), and the second problem is maximum tardy jobs time and range of lateness jobs times (1//(T_max,R_L ) in a single machine with Multi-Objective Machine Scheduling Problems (MOMSP) 1//(E_max+R_L ) and 1//(T_max+R_L ) which are derived from the main problems respectively. The Local Search Methods (LSMs), Bees Algorithm (BA), and a Simulated Annealing (SA) are applied to solve all suggested problems. Finally, the experimental results of the LSMs are compared with the results of the Branch and Bound (BAB) method for a reasonable time. These results are ensuring the efficiency of LSMs.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
