{"title":"一种新的混合启发式排序流水车间总流水时间最小化算法","authors":"W. Phaphan","doi":"10.1145/3133811.3133814","DOIUrl":null,"url":null,"abstract":"The paper addresses an n-job, m-machinery permutation flow shop scheduling problem with minimization of the total flow time objective. We present a new modified version of the heuristic of Woo and Yim and the heuristic of Laha and Sarin, named \"WYLS heuristic\". Extensive computational experimentation were conducted to examine the performance of the proposed heuristic. Statistically significant represents the LS, proposed, FL, WY and NEH heuristics have equivalent performance, while Gupta's heuristic is the least effective.","PeriodicalId":403248,"journal":{"name":"Proceedings of the 3rd International Conference on Industrial and Business Engineering","volume":"99 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A New Hybrid Heuristic for Minimizing Total Flow Time in Permutation Flow Shop\",\"authors\":\"W. Phaphan\",\"doi\":\"10.1145/3133811.3133814\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper addresses an n-job, m-machinery permutation flow shop scheduling problem with minimization of the total flow time objective. We present a new modified version of the heuristic of Woo and Yim and the heuristic of Laha and Sarin, named \\\"WYLS heuristic\\\". Extensive computational experimentation were conducted to examine the performance of the proposed heuristic. Statistically significant represents the LS, proposed, FL, WY and NEH heuristics have equivalent performance, while Gupta's heuristic is the least effective.\",\"PeriodicalId\":403248,\"journal\":{\"name\":\"Proceedings of the 3rd International Conference on Industrial and Business Engineering\",\"volume\":\"99 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-08-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 3rd International Conference on Industrial and Business Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3133811.3133814\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 3rd International Conference on Industrial and Business Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3133811.3133814","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A New Hybrid Heuristic for Minimizing Total Flow Time in Permutation Flow Shop
The paper addresses an n-job, m-machinery permutation flow shop scheduling problem with minimization of the total flow time objective. We present a new modified version of the heuristic of Woo and Yim and the heuristic of Laha and Sarin, named "WYLS heuristic". Extensive computational experimentation were conducted to examine the performance of the proposed heuristic. Statistically significant represents the LS, proposed, FL, WY and NEH heuristics have equivalent performance, while Gupta's heuristic is the least effective.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
