{"title":"A supervised self-organizing approach for large-scale multistage batch scheduling problems","authors":"Fan Yang, Tao Liang, Wen Song, Qiqiang Li","doi":"10.1109/ICCA.2013.6565051","DOIUrl":null,"url":null,"abstract":"This paper presents a supervised self-organizing approach for solving the scheduling problems of large-scale multistage batch plants. The proposed approach is based on a supervised self-organizing model, which consists of a self-organizing scheduling system and a supervisory unit. Four types of self-organizing units are defined in the self-organizing scheduling system and they can be guided by the supervisory unit in a global perspective. A supervised self-organizing algorithm, in which minimum makespan is selected as the scheduling objective, is also proposed to solve the supervised self-organizing model. An illustrative example has been efficiently solved. Compared with MILP approach, the proposed approach shows its superiority in solving large-scale complex problems.","PeriodicalId":336534,"journal":{"name":"2013 10th IEEE International Conference on Control and Automation (ICCA)","volume":"147 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 10th IEEE International Conference on Control and Automation (ICCA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCA.2013.6565051","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
This paper presents a supervised self-organizing approach for solving the scheduling problems of large-scale multistage batch plants. The proposed approach is based on a supervised self-organizing model, which consists of a self-organizing scheduling system and a supervisory unit. Four types of self-organizing units are defined in the self-organizing scheduling system and they can be guided by the supervisory unit in a global perspective. A supervised self-organizing algorithm, in which minimum makespan is selected as the scheduling objective, is also proposed to solve the supervised self-organizing model. An illustrative example has been efficiently solved. Compared with MILP approach, the proposed approach shows its superiority in solving large-scale complex problems.