{"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}
引用次数: 95
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
