A genetic algorithm methodology for comp
β
Bryan A. Norman; James C. Bean
π
Article
π
1999
π
John Wiley and Sons
π
English
β 79 KB
π 2 views
This paper considers the scheduling problem to minimize total tardiness given multiple machines, ready times, sequence dependent setups, machine downtime and scarce tools. We develop a genetic algorithm based on random keys representation, elitist reproduction, Bernoulli crossover and immigration ty