|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
2009 International Conference on Computational Intelligence and Security
Research on Job-Shop Scheduling Problem Based on Genetic Ant Colony Algorithms
Beijing, China
December 11-December 14
ISBN: 978-0-7695-3931-7
| ASCII Text | x | ||
| Zheng-jia Wu, Li-ping Zhang, Wen Wang, Kui Wang, "Research on Job-Shop Scheduling Problem Based on Genetic Ant Colony Algorithms," 2012 Eighth International Conference on Computational Intelligence and Security, vol. 2, pp. 114-118, 2009 International Conference on Computational Intelligence and Security, 2009. | |||
| BibTex | x | ||
| @article{ 10.1109/CIS.2009.60, author = {Zheng-jia Wu and Li-ping Zhang and Wen Wang and Kui Wang}, title = {Research on Job-Shop Scheduling Problem Based on Genetic Ant Colony Algorithms}, journal ={2012 Eighth International Conference on Computational Intelligence and Security}, volume = {2}, year = {2009}, isbn = {978-0-7695-3931-7}, pages = {114-118}, doi = {http://doi.ieeecomputersociety.org/10.1109/CIS.2009.60}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - 2012 Eighth International Conference on Computational Intelligence and Security TI - Research on Job-Shop Scheduling Problem Based on Genetic Ant Colony Algorithms SN - 978-0-7695-3931-7 SP114 EP118 A1 - Zheng-jia Wu, A1 - Li-ping Zhang, A1 - Wen Wang, A1 - Kui Wang, PY - 2009 KW - Job-Shop scheduling problem KW - genetic ant colony algorithm KW - master-slave structure KW - optimization VL - 2 JA - 2012 Eighth International Conference on Computational Intelligence and Security ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CIS.2009.60
The Job-Shop scheduling problem by the minimum makespan is researched and its mathematical model with multi-restricted condition is established. In order to improve the ant colony algorithm deficiency of poor convergence and easy to fall in local optima, a genetic ant colony algorithm with master-slave structure is designed. In this algorithm, ant colony algorithm is regarded as master algorithm, and genetic algorithm as slave algorithm. Finally, computational tests based on the well known benchmark suites in the literature are conducted, and the computational results show that the presented algorithm is effective in finding optimal and near-optimal solutions.
Index Terms:
Job-Shop scheduling problem, genetic ant colony algorithm, master-slave structure, optimization
Citation:
Zheng-jia Wu, Li-ping Zhang, Wen Wang, Kui Wang, "Research on Job-Shop Scheduling Problem Based on Genetic Ant Colony Algorithms," cis, vol. 2, pp.114-118, 2009 International Conference on Computational Intelligence and Security, 2009
Usage of this product signifies your acceptance of the Terms of Use.