LIP6 1998/013

• Reports
  Algorithmes Génétiques pour le problème d'ordonnancement job-shop avec machines en parallèle et contraintes de précédence.: méthode par brassage d'heuristiques
• F. Ghedjati
• 10 pages - 03/16/1998- document en - http://www.lip6.fr/lip6/reports/1998/lip6.1998.013.ps.gz - 105 Ko
• Contact : Fatima.Ghedjati (at) nulllip6.fr
• Ancien Thème : SYSDEF
In this paper, we are interested, in the generalized job-shop scheduling problem with several unrelated parallel machines and precedence constraints (corresponding to linear and non-linear process routings) between operations of the job. The objective is to minimize the maximum completion time (Cmax). We propose an original resolution method based on genetic algorithms that we call heuristic mixing method, where crossovers mixe a specific heuristics designed for the considered problem. After a description of the problem and of the resolution method, we present experiment results.
• Keywords : Scheduling, Generalized job-shop, Unrelated parallel machines, Linear and non-linear process routings, Genetic algoritms, heuristic mixing method
• Publisher : Valerie.Mangin (at) nulllip6.fr