| Article ID: | iaor20013932 |
| Country: | China |
| Volume: | 22 |
| Issue: | 4 |
| Start Page Number: | 69 |
| End Page Number: | 73 |
| Publication Date: | Apr 2000 |
| Journal: | Chinese Journal of Systems Engineering and Electronics |
| Authors: | Huo Hongwei, Xu Jin, Bao Zheng |
| Keywords: | genetic algorithms |
It is well-known that the job-scheduling problem with deadline is a fundamental problem in management and operating systems. In this paper, we use GA (genetic algorithm) to give an algorithm for the job-scheduling problems in uni-processor and non-constrained resource in which each job can be finished in the same time. By analyzing some properties of job-scheduling problems, a new genetic algorithm is presented. The experimental results show that the algorithm is strongly robust.