{"title":"非等量单批处理机总完成时间最小化的混合蚁群优化","authors":"Rui Xu, Hua-ping Chen, Jun-Hong Zhu, Hao Shao","doi":"10.1109/ICNC.2008.384","DOIUrl":null,"url":null,"abstract":"This paper aims at minimizing the total completion time for a single batch processing machine with non-identical job sizes. For this problem, each job has a corresponding processing time and size. The machine can process the jobs in batches as long as the total size of all the jobs in a batch does not exceed the machine capacity. The processing time of a batch is equal to the longest processing time among all the jobs in that batch. This problem is NP-hard and hence a chaotic ant colony optimization algorithm based on batch sequence (BCACO) is proposed. Random instances were used to test the effectiveness of the proposed approach. Computational results show that BCACO significantly outperforms other algorithms addressed in the literature.","PeriodicalId":6404,"journal":{"name":"2008 Fourth International Conference on Natural Computation","volume":"1 1","pages":"439-443"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Hybrid Ant Colony Optimization to Minimize the Total Completion Time on a Single Batch Processing Machine with Non-identical Job Sizes\",\"authors\":\"Rui Xu, Hua-ping Chen, Jun-Hong Zhu, Hao Shao\",\"doi\":\"10.1109/ICNC.2008.384\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper aims at minimizing the total completion time for a single batch processing machine with non-identical job sizes. For this problem, each job has a corresponding processing time and size. The machine can process the jobs in batches as long as the total size of all the jobs in a batch does not exceed the machine capacity. The processing time of a batch is equal to the longest processing time among all the jobs in that batch. This problem is NP-hard and hence a chaotic ant colony optimization algorithm based on batch sequence (BCACO) is proposed. Random instances were used to test the effectiveness of the proposed approach. Computational results show that BCACO significantly outperforms other algorithms addressed in the literature.\",\"PeriodicalId\":6404,\"journal\":{\"name\":\"2008 Fourth International Conference on Natural Computation\",\"volume\":\"1 1\",\"pages\":\"439-443\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-10-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 Fourth International Conference on Natural Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNC.2008.384\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Fourth International Conference on Natural Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNC.2008.384","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Hybrid Ant Colony Optimization to Minimize the Total Completion Time on a Single Batch Processing Machine with Non-identical Job Sizes
This paper aims at minimizing the total completion time for a single batch processing machine with non-identical job sizes. For this problem, each job has a corresponding processing time and size. The machine can process the jobs in batches as long as the total size of all the jobs in a batch does not exceed the machine capacity. The processing time of a batch is equal to the longest processing time among all the jobs in that batch. This problem is NP-hard and hence a chaotic ant colony optimization algorithm based on batch sequence (BCACO) is proposed. Random instances were used to test the effectiveness of the proposed approach. Computational results show that BCACO significantly outperforms other algorithms addressed in the literature.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
