{"title":"柔性作业车间调度问题的多起点路径链接算法","authors":"Sahar Bakhtar, H. Jazayeriy, M. Valinataj","doi":"10.1109/IKT.2015.7288747","DOIUrl":null,"url":null,"abstract":"Scheduling is a well-known NP-hard problem. The flexible job-shop scheduling problem (FJSP) is an extention of the classical job-shop scheduling problem(JSP). FJSP allows an operation of each job to be performed by any machine out of a set of available machines. FJSP consists two sub-problems which are assigning each operation to a machine out of a set of capable machines and sequencing the assigned operations on the machines. This paper proposes a path-relinking(PR) algorithm that solves the FJSP to minimize makespan. Also, a GRASP method has been used for creating the initial solutions. The proposed algorithm is evaluated by testing on a set of 15 benchmark problems. The computational results show that the proposed algorithm is an effective approach to solve the FJSP.","PeriodicalId":338953,"journal":{"name":"2015 7th Conference on Information and Knowledge Technology (IKT)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"A multi-start path-relinking algorithm for the flexible job-shop scheduling problem\",\"authors\":\"Sahar Bakhtar, H. Jazayeriy, M. Valinataj\",\"doi\":\"10.1109/IKT.2015.7288747\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Scheduling is a well-known NP-hard problem. The flexible job-shop scheduling problem (FJSP) is an extention of the classical job-shop scheduling problem(JSP). FJSP allows an operation of each job to be performed by any machine out of a set of available machines. FJSP consists two sub-problems which are assigning each operation to a machine out of a set of capable machines and sequencing the assigned operations on the machines. This paper proposes a path-relinking(PR) algorithm that solves the FJSP to minimize makespan. Also, a GRASP method has been used for creating the initial solutions. The proposed algorithm is evaluated by testing on a set of 15 benchmark problems. The computational results show that the proposed algorithm is an effective approach to solve the FJSP.\",\"PeriodicalId\":338953,\"journal\":{\"name\":\"2015 7th Conference on Information and Knowledge Technology (IKT)\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-05-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 7th Conference on Information and Knowledge Technology (IKT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IKT.2015.7288747\",\"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 7th Conference on Information and Knowledge Technology (IKT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IKT.2015.7288747","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A multi-start path-relinking algorithm for the flexible job-shop scheduling problem
Scheduling is a well-known NP-hard problem. The flexible job-shop scheduling problem (FJSP) is an extention of the classical job-shop scheduling problem(JSP). FJSP allows an operation of each job to be performed by any machine out of a set of available machines. FJSP consists two sub-problems which are assigning each operation to a machine out of a set of capable machines and sequencing the assigned operations on the machines. This paper proposes a path-relinking(PR) algorithm that solves the FJSP to minimize makespan. Also, a GRASP method has been used for creating the initial solutions. The proposed algorithm is evaluated by testing on a set of 15 benchmark problems. The computational results show that the proposed algorithm is an effective approach to solve the FJSP.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
