Genetic algorithms (GAs) constitute a technique that has been applied with advantage to a variety of combinatorial problems. This work shows how the GAs can be used to optimize the job shop problem with many tasks, many machines, and precedence constraints. The authors introduce the technique of GAs and then show what makes the treatment of the job shop scheduling difficult. They then present an encoding of the problem that overcomes these difficulties. The performance of the algorithm is demonstrated with examples of real-world size.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
No takes yet. Share an insight, caveat, or question.
Falkenauer et al. (2002) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: