{"title":"使用精确和启发式方法解决最大提前工作时间和延迟工作时间范围问题","authors":"Safanah Faisal Yousif, F. Ali","doi":"10.24996/ijs.2024.65.2.28","DOIUrl":null,"url":null,"abstract":" In this paper, a solution to one of the Bicriteria Machine Scheduling Problems (BCMSP) is proposed. This problem focuses on the maximum early jobs time and range of lateness jobs time on a single machine (1//(E_max,R_L )). First, we derive a subproblem 1//(E_max+R_L ) from the main problem which is a special case for the suggested problem. Secondly, both exact complete enumeration and Branch and Bound (BAB) with two new lower bounds with some heuristic methods to solve the problems are proposed. The results prove the accuracy of BAB to solve the problem for n≤110 jobs in a reasonable time. In addition, the accuracy of the suggested heuristic methods is compared with the results of the exact methods.","PeriodicalId":14698,"journal":{"name":"Iraqi Journal of Science","volume":"30 4","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-02-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Solving Maximum Early Jobs Time and Range of Lateness Jobs Times Problem Using Exact and Heuristic Methods\",\"authors\":\"Safanah Faisal Yousif, F. Ali\",\"doi\":\"10.24996/ijs.2024.65.2.28\",\"DOIUrl\":null,\"url\":null,\"abstract\":\" In this paper, a solution to one of the Bicriteria Machine Scheduling Problems (BCMSP) is proposed. This problem focuses on the maximum early jobs time and range of lateness jobs time on a single machine (1//(E_max,R_L )). First, we derive a subproblem 1//(E_max+R_L ) from the main problem which is a special case for the suggested problem. Secondly, both exact complete enumeration and Branch and Bound (BAB) with two new lower bounds with some heuristic methods to solve the problems are proposed. The results prove the accuracy of BAB to solve the problem for n≤110 jobs in a reasonable time. In addition, the accuracy of the suggested heuristic methods is compared with the results of the exact methods.\",\"PeriodicalId\":14698,\"journal\":{\"name\":\"Iraqi Journal of Science\",\"volume\":\"30 4\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-02-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Iraqi Journal of Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.24996/ijs.2024.65.2.28\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Earth and Planetary Sciences\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Iraqi Journal of Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.24996/ijs.2024.65.2.28","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Earth and Planetary Sciences","Score":null,"Total":0}
Solving Maximum Early Jobs Time and Range of Lateness Jobs Times Problem Using Exact and Heuristic Methods
In this paper, a solution to one of the Bicriteria Machine Scheduling Problems (BCMSP) is proposed. This problem focuses on the maximum early jobs time and range of lateness jobs time on a single machine (1//(E_max,R_L )). First, we derive a subproblem 1//(E_max+R_L ) from the main problem which is a special case for the suggested problem. Secondly, both exact complete enumeration and Branch and Bound (BAB) with two new lower bounds with some heuristic methods to solve the problems are proposed. The results prove the accuracy of BAB to solve the problem for n≤110 jobs in a reasonable time. In addition, the accuracy of the suggested heuristic methods is compared with the results of the exact methods.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
