{"title":"并行机调度问题中系统可用性最大化的启发式算法","authors":"Asmaa Khoudi, A. Berrichi, F. Yalaoui","doi":"10.1109/ISPS.2015.7244995","DOIUrl":null,"url":null,"abstract":"This paper deals with a scheduling problem on Identical Parallel Machines where machines are subject to potentially costly failures. Failures can be avoided by an appropriate Preventive Maintenance (PM) planning. The preemption of production jobs is not allowed. The PM activities must be carried out by taking into consideration the production constraints. We assume that PM activities are performed after each job and they restore the machines to “as good as new” conditions. The objective is to find the best assignment of jobs on machines maximizing the system availability. We have proposed heuristics to deal with the problem. Experimental results are conducted to test the efficiency of our heuristics throughout 380 test problem instances.","PeriodicalId":165465,"journal":{"name":"2015 12th International Symposium on Programming and Systems (ISPS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Heuristics to maximize system availability on parallel machine scheduling problem\",\"authors\":\"Asmaa Khoudi, A. Berrichi, F. Yalaoui\",\"doi\":\"10.1109/ISPS.2015.7244995\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper deals with a scheduling problem on Identical Parallel Machines where machines are subject to potentially costly failures. Failures can be avoided by an appropriate Preventive Maintenance (PM) planning. The preemption of production jobs is not allowed. The PM activities must be carried out by taking into consideration the production constraints. We assume that PM activities are performed after each job and they restore the machines to “as good as new” conditions. The objective is to find the best assignment of jobs on machines maximizing the system availability. We have proposed heuristics to deal with the problem. Experimental results are conducted to test the efficiency of our heuristics throughout 380 test problem instances.\",\"PeriodicalId\":165465,\"journal\":{\"name\":\"2015 12th International Symposium on Programming and Systems (ISPS)\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-04-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 12th International Symposium on Programming and Systems (ISPS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPS.2015.7244995\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 12th International Symposium on Programming and Systems (ISPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPS.2015.7244995","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Heuristics to maximize system availability on parallel machine scheduling problem
This paper deals with a scheduling problem on Identical Parallel Machines where machines are subject to potentially costly failures. Failures can be avoided by an appropriate Preventive Maintenance (PM) planning. The preemption of production jobs is not allowed. The PM activities must be carried out by taking into consideration the production constraints. We assume that PM activities are performed after each job and they restore the machines to “as good as new” conditions. The objective is to find the best assignment of jobs on machines maximizing the system availability. We have proposed heuristics to deal with the problem. Experimental results are conducted to test the efficiency of our heuristics throughout 380 test problem instances.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
