Modelling 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 an 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 completion time will be used such as an objective function and not a criterion of the decision. The new approach use heuristic elementary priority dispatch rules as a 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 solutions of the problem. Determination of the solution's space is realized by a metaalgorithm which take in account all the variants of the solutions of the process.