Modeling and Simulation of Holonic Meta-Algorithm in Scheduling Process Using PERT Technique − Optimization in Job Shop Scheduling Problem

In generally scheduling can be viewed as optimization, bound by sequence and resource constrain and the minimization of the makespan is often used as the criterion. In this paper minimization of the makespan or complete time will be used such as an objective function and not the criterion of the decision. The new approach use heuristic elementary priority dispatch rules as the criterion of the decision. This research purpose a new methodology which use a specific elements of PERT techniques to find the optimum solution. New approach establish a solution's space where are find the all solution of the problem. Determination of the solution's space is realized by a meta-algorithm which take in account all the variant of the solutions of the process.