Hybrid genetic algorithms: solutions in realistic dynamic and setup dependent job-shop scheduling problems

• Published in: International journal of production management and engineering Vol. 4; no. 2; pp. 75 - 85
• Main Authors: Branco, Rogério M., Coelho, Antônio S., Mayerle, Sérgio F.
• Format: Journal Article
• Language: English
• Published: Universitat Politecnica de Valencia 13-07-2016
• Subjects: dispatching rules; genetic algorithms; realistic job-shop scheduling
• ISSN: 2340-4876; 2340-4876
• DOI: 10.4995/ijpme.2016.5780

This paper discusses the application of heuristic-based evolutionary technique in search for solutions concerning the dynamic job-shop scheduling problems with dependent setup times and alternate routes. With a combinatorial nature, these problems belong to an NP-hard class, with an aggravated condition when in realistic, dynamic and therefore, more complex cases than the traditional static ones. The proposed genetic algorithm executes two important functions: choose the routes using dispatching rules when forming each individual from a defined set of available machines and, also make the scheduling for each of these individuals created. The chromosome codifies a route, or the selected machines, and also an order to process the operations. In essence , each individual needs to be decoded by the scheduler to evaluate its time of completion, so the fitness function of the genetic algorithm, applying the modified Giffler and Thomson’s algorithm, obtains a scheduling of the selected routes in a given planning horizon. The scheduler considers the preparation time between operations on the machines and can manage operations exchange respecting the route and the order given by the chromosome. The best results in the evolutionary process are individuals with routes and processing orders optimized for this type of problema.