| Article ID: | iaor2002230 |
| Country: | China |
| Volume: | 22 |
| Issue: | 6 |
| Start Page Number: | 90 |
| End Page Number: | 93 |
| Publication Date: | Jun 2000 |
| Journal: | Chinese Journal of Systems Engineering and Electronics |
| Authors: | Cai Liangwei, Yang Zhengzheng, Wu Qinghua |
| Keywords: | genetic algorithms |
This paper presents a genetic algorithm to solve the classic machine scheduling problem. The algorithm has a simple coding scheme and new crossover and mutation operators. It is used to solve three famous Muth–Thompson problems and their optimal solutions are found. Computation shows that the algorithm is efficient and can be used to solve complicated combinatorial optimization problems such as machine scheduling.