W. Wongthatsanekorn, B. Phruksaphanrat, Rataphol Sangkahsuk
{"title":"蜂群优化启发式算法在成组制造生产调度中的应用","authors":"W. Wongthatsanekorn, B. Phruksaphanrat, Rataphol Sangkahsuk","doi":"10.5481/KKUENJ.2013.40.1.6","DOIUrl":null,"url":null,"abstract":"This paper presents the application of Bee Colony Optimization (BCO) for solving make-pack problem. The objective is to reduce the makespan while satisfying the restrictions on the number and capacity of production resources, resource usage and production time for each production, product change over and the production transfer. BCO is applied to solve make-pack problem with four productions resources; premix tank, mix tank, storage tank and packing line. Small and realistic-sized case studies are conducted with BCO. Small case study contains two bulk formulas and 10 final products. The results show that BCO can find the same minimum makespan (1,447.56 minutes) in every trial. The average run time is 5.91 seconds. For the realistic-sized case study with 59 bulk formulas and 203 final products, the results show that the minimum makespan in every trial is slightly different. The mean deviation from the minimum solution (7,283 minutes) is only 0.5% with average run time of 1078.1seconds.","PeriodicalId":37310,"journal":{"name":"Engineering and Applied Science Research","volume":"40 1","pages":"47-56"},"PeriodicalIF":0.0000,"publicationDate":"2013-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Applying bee colony optimization heuristic for production scheduling in make-pack manufacturing\",\"authors\":\"W. Wongthatsanekorn, B. Phruksaphanrat, Rataphol Sangkahsuk\",\"doi\":\"10.5481/KKUENJ.2013.40.1.6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents the application of Bee Colony Optimization (BCO) for solving make-pack problem. The objective is to reduce the makespan while satisfying the restrictions on the number and capacity of production resources, resource usage and production time for each production, product change over and the production transfer. BCO is applied to solve make-pack problem with four productions resources; premix tank, mix tank, storage tank and packing line. Small and realistic-sized case studies are conducted with BCO. Small case study contains two bulk formulas and 10 final products. The results show that BCO can find the same minimum makespan (1,447.56 minutes) in every trial. The average run time is 5.91 seconds. For the realistic-sized case study with 59 bulk formulas and 203 final products, the results show that the minimum makespan in every trial is slightly different. The mean deviation from the minimum solution (7,283 minutes) is only 0.5% with average run time of 1078.1seconds.\",\"PeriodicalId\":37310,\"journal\":{\"name\":\"Engineering and Applied Science Research\",\"volume\":\"40 1\",\"pages\":\"47-56\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-05-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Engineering and Applied Science Research\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5481/KKUENJ.2013.40.1.6\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Engineering\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Engineering and Applied Science Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5481/KKUENJ.2013.40.1.6","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}
Applying bee colony optimization heuristic for production scheduling in make-pack manufacturing
This paper presents the application of Bee Colony Optimization (BCO) for solving make-pack problem. The objective is to reduce the makespan while satisfying the restrictions on the number and capacity of production resources, resource usage and production time for each production, product change over and the production transfer. BCO is applied to solve make-pack problem with four productions resources; premix tank, mix tank, storage tank and packing line. Small and realistic-sized case studies are conducted with BCO. Small case study contains two bulk formulas and 10 final products. The results show that BCO can find the same minimum makespan (1,447.56 minutes) in every trial. The average run time is 5.91 seconds. For the realistic-sized case study with 59 bulk formulas and 203 final products, the results show that the minimum makespan in every trial is slightly different. The mean deviation from the minimum solution (7,283 minutes) is only 0.5% with average run time of 1078.1seconds.
期刊介绍:
Publication of the journal started in 1974. Its original name was “KKU Engineering Journal”. English and Thai manuscripts were accepted. The journal was originally aimed at publishing research that was conducted and implemented in the northeast of Thailand. It is regarded a national journal and has been indexed in the Thai-journal Citation Index (TCI) database since 2004. The journal now accepts only English language manuscripts and became open-access in 2015 to attract more international readers. It was renamed Engineering and Applied Science Research in 2017. The editorial team agreed to publish more international papers, therefore, the new journal title is more appropriate. The journal focuses on research in the field of engineering that not only presents highly original ideas and advanced technology, but also are practical applications of appropriate technology.