S. Chandrasekaran, R. Suresh, S. Ponnambalam, N. Vijayakumar
{"title":"粒子群优化算法在最大完工时间、总流程时间和完工时间方差最小的置换流水车间调度问题中的应用","authors":"S. Chandrasekaran, R. Suresh, S. Ponnambalam, N. Vijayakumar","doi":"10.1109/COASE.2006.326934","DOIUrl":null,"url":null,"abstract":"The problem of scheduling in flowshops with the objective of minimizing makespan, total flowtime and completion time variation is studied in this paper. A simple discrete version of particle swarm optimization algorithm (PSO) is proposed for solving the set of benchmark flowshop scheduling problems proposed by Taillard (1993). The obtained results are better when compared with the results published in the literature.","PeriodicalId":116108,"journal":{"name":"2006 IEEE International Conference on Automation Science and Engineering","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"An Application of Particle Swarm Optimization Algorithm to Permutation Flowshop Scheduling Problems to Minimize Makespan, Total Flowtime and Completion Time Variance\",\"authors\":\"S. Chandrasekaran, R. Suresh, S. Ponnambalam, N. Vijayakumar\",\"doi\":\"10.1109/COASE.2006.326934\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of scheduling in flowshops with the objective of minimizing makespan, total flowtime and completion time variation is studied in this paper. A simple discrete version of particle swarm optimization algorithm (PSO) is proposed for solving the set of benchmark flowshop scheduling problems proposed by Taillard (1993). The obtained results are better when compared with the results published in the literature.\",\"PeriodicalId\":116108,\"journal\":{\"name\":\"2006 IEEE International Conference on Automation Science and Engineering\",\"volume\":\"56 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE International Conference on Automation Science and Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COASE.2006.326934\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE International Conference on Automation Science and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COASE.2006.326934","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Application of Particle Swarm Optimization Algorithm to Permutation Flowshop Scheduling Problems to Minimize Makespan, Total Flowtime and Completion Time Variance
The problem of scheduling in flowshops with the objective of minimizing makespan, total flowtime and completion time variation is studied in this paper. A simple discrete version of particle swarm optimization algorithm (PSO) is proposed for solving the set of benchmark flowshop scheduling problems proposed by Taillard (1993). The obtained results are better when compared with the results published in the literature.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
