A modified continuous genetic algorithm and its application for job-shop scheduling

The continuous genetic algorithm has a risk for long staying on one stage before it gains the best solution. This paper presents the modified continuous genetic algorithm to overcome this disadvantage. This algorithm is applied to job-shop scheduling to test its validity. The test results show this algorithm is good at operation and convergence.