Research on Job-Shop Scheduling Problem Based on Genetic Ant Colony Algorithms

Author

Wu Zheng-jia ; Zhang Li-ping ; Wang Wen ; Wang Kui

Author_Institution

Coll. of Mech. & Mater. Eng., China Three Gorges Univ., Yichang, China

Volume

2

fYear

2009

fDate

11-14 Dec. 2009

Firstpage

114

Lastpage

118

Abstract

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.

Keywords

genetic algorithms; job shop scheduling; genetic ant colony algorithms; job-shop scheduling problem; master-slave structure; mathematical model; Algorithm design and analysis; Ant colony optimization; Computational intelligence; Genetic algorithms; Job shop scheduling; Master-slave; Mathematical model; Processor scheduling; Scheduling algorithm; Security; Job-Shop scheduling problem; genetic ant colony algorithm; master-slave structure; optimization;

fLanguage

English

Publisher

ieee

Conference_Titel

Computational Intelligence and Security, 2009. CIS '09. International Conference on

Conference_Location

Beijing

Print_ISBN

978-1-4244-5411-2

Type

conf

DOI

10.1109/CIS.2009.60

Filename

5375963