蚁群优化的FOP车间调度:不同信息素表示的案例研究

Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600) Pub Date : 2002-05-12 DOI:10.1109/CEC.2002.1004474

C. Blum, M. Sampels

{"title":"蚁群优化的FOP车间调度:不同信息素表示的案例研究","authors":"C. Blum, M. Sampels","doi":"10.1109/CEC.2002.1004474","DOIUrl":null,"url":null,"abstract":"In this work we deal with the FOP shop scheduling problem which is a general scheduling problem including job shop scheduling, open shop scheduling and mixed shop scheduling as special cases. The aim of this paper is to compare different pheromone representations taken from the literature with our new approach. The pheromone representations are used by an ant colony optimization algorithm to construct solutions to the FOP shop scheduling problem.","PeriodicalId":184547,"journal":{"name":"Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)","volume":"326 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"95","resultStr":"{\"title\":\"Ant colony optimization for FOP shop scheduling: a case study on different pheromone representations\",\"authors\":\"C. Blum, M. Sampels\",\"doi\":\"10.1109/CEC.2002.1004474\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this work we deal with the FOP shop scheduling problem which is a general scheduling problem including job shop scheduling, open shop scheduling and mixed shop scheduling as special cases. The aim of this paper is to compare different pheromone representations taken from the literature with our new approach. The pheromone representations are used by an ant colony optimization algorithm to construct solutions to the FOP shop scheduling problem.\",\"PeriodicalId\":184547,\"journal\":{\"name\":\"Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)\",\"volume\":\"326 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-05-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"95\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC.2002.1004474\",\"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 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2002.1004474","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 95

摘要

本文研究的是一类一般调度问题，包括作业车间调度、开放车间调度和混合车间调度。本文的目的是比较不同的信息素表示采取从文献与我们的新方法。通过蚁群优化算法，利用信息素表示构造出FOP车间调度问题的解。

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

查看原文本刊更多论文

Ant colony optimization for FOP shop scheduling: a case study on different pheromone representations

In this work we deal with the FOP shop scheduling problem which is a general scheduling problem including job shop scheduling, open shop scheduling and mixed shop scheduling as special cases. The aim of this paper is to compare different pheromone representations taken from the literature with our new approach. The pheromone representations are used by an ant colony optimization algorithm to construct solutions to the FOP shop scheduling problem.

求助全文

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

来源期刊

Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)

自引率

0.00%

发文量