Genetic algorithms using multi-objective
β
Alain Cardon; Thierry Galinho; Jean-Philippe Vacher
π
Article
π
2000
π
Elsevier Science
π
English
β 827 KB
We are interested in a job-shop scheduling problem corresponding to an industrial problem. Gantt diagram's optimization can be considered as an NP-difficult problem. Determining an optimal solution is almost impossible, but trying to improve the current solution is a way of leading to a better alloc