LIP6 1997/005

• Reports
  Résolution du problème d'ordonnancement de type Job-Shop généralisé par des heuristiques dynamiques
• F. Ghedjati, J.-Ch.Pomerol
• 25 pages - 06/12/1997- document en - http://www.lip6.fr/lip6/reports/1997/lip6.1997.005.ps.gz - 50 Ko
• Contact : Fatima.Ghedjati (at) nulllaforia.ibp.fr, Valerie.Mangin (at) nulllip6.fr
• Ancien Thème : SYSDEF
This paper proposes a solution of the generalized job-shop factory scheduling problems by several original of static and dynamic heuristics relying on the potential load of the machines. On the one hand, we consider, unrelated parallel machines which can execute the operations of the different jobs, and, on the other hand, any precedence contraints between the operations is allowed. The objective of the scheduling is to minimize the total duration of all the jobs, i.e. to minimize the Cmax. This problem is NP-Hard. Experimental results using different types of data, taken from the literature or randomly generated benchmarks are provided. Our approach allows a satifactory resolution of relatively important problems in a raisonable time.
• Keywords : Scheduling, Generalized job-shop, Unrelated parallel machines, Linear and non-linear process rooting, Dynamical heuristics
• Publisher :