Research Article
A Makespan Optimization Scheme for NP-Hard Gari Processing Job Scheduling Using Improved Genetic Algorithm
Algorithm 1
Simple genetic algorithm ( ).
{ | Generate initial population randomly | Calculate the fitness value of chromosomes | While termination condition not satisfied | { | Process crossover and mutation at chromosomes | Calculate the fitness value of chromosomes | Select the offspring to next generation | } | } |
|