粒子群优化算法在最大完工时间、总流程时间和完工时间方差最小的置换流水车间调度问题中的应用

2006 IEEE International Conference on Automation Science and Engineering Pub Date : 2006-10-01 DOI:10.1109/COASE.2006.326934

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}

引用次数: 6

摘要

研究了以最大完工时间、总流程时间和完工时间变化最小为目标的流水车间调度问题。针对Taillard(1993)提出的一组基准流水车间调度问题，提出了一种简单的离散粒子群优化算法(PSO)。所得结果与已发表的文献结果进行了比较。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2006 IEEE International Conference on Automation Science and Engineering

自引率

0.00%

发文量