{"title":"无等待流水车间调度问题的混合启发式算法","authors":"V. Riahi, Morteza Kazemi","doi":"10.1109/CSICSSE.2015.7369247","DOIUrl":null,"url":null,"abstract":"The no-wait flowshop scheduling problem (NWFSP) that needs jobs to be processed without interruption between consecutive machines is a NP-hard combinatorial optimization problem, and embodies a significant area in production scheduling. The objective is set to find the scheduling which minimizes the makespan. In this paper, a new hybrid ant colony optimization (ACO) and Simulated Annealing (SA) algorithm is presented to solve NWFSP. The computational results on 29 benchmark instances provided by Carlier and Reeves and comparison with other reported results in the literature approves the efficiency of the proposed algorithm.","PeriodicalId":115653,"journal":{"name":"2015 International Symposium on Computer Science and Software Engineering (CSSE)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A hybrid heuristic algorithm for the no-wait flowshop scheduling problem\",\"authors\":\"V. Riahi, Morteza Kazemi\",\"doi\":\"10.1109/CSICSSE.2015.7369247\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The no-wait flowshop scheduling problem (NWFSP) that needs jobs to be processed without interruption between consecutive machines is a NP-hard combinatorial optimization problem, and embodies a significant area in production scheduling. The objective is set to find the scheduling which minimizes the makespan. In this paper, a new hybrid ant colony optimization (ACO) and Simulated Annealing (SA) algorithm is presented to solve NWFSP. The computational results on 29 benchmark instances provided by Carlier and Reeves and comparison with other reported results in the literature approves the efficiency of the proposed algorithm.\",\"PeriodicalId\":115653,\"journal\":{\"name\":\"2015 International Symposium on Computer Science and Software Engineering (CSSE)\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 International Symposium on Computer Science and Software Engineering (CSSE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSICSSE.2015.7369247\",\"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 International Symposium on Computer Science and Software Engineering (CSSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSICSSE.2015.7369247","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A hybrid heuristic algorithm for the no-wait flowshop scheduling problem
The no-wait flowshop scheduling problem (NWFSP) that needs jobs to be processed without interruption between consecutive machines is a NP-hard combinatorial optimization problem, and embodies a significant area in production scheduling. The objective is set to find the scheduling which minimizes the makespan. In this paper, a new hybrid ant colony optimization (ACO) and Simulated Annealing (SA) algorithm is presented to solve NWFSP. The computational results on 29 benchmark instances provided by Carlier and Reeves and comparison with other reported results in the literature approves the efficiency of the proposed algorithm.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
