S. G. Bhatwadekar

Dr. M.Y. Khire

Abstract

Job shop schedulingproblem (JSSP) is a combinatorial optimization problem and difficult to enumerate for optimization purpose. An exhaustive enumeration ofthe JSSP is practically impossible even on a computer. The Genetic Algorithms (GA) processes a number of schedules in a step and carries them over to the next step. Representation ofthe schedules and design of GA operators influence the performance ofthe GA significantly. In this paper, an attempt is made to validate statistically the ability of the GA, to find out a workable good schedule converging in a finite number of iterations. This solution can be improvedfurther.

Keywords-