NON-DETERMINISTIC DYNAMIC JOB SHOP PROGRAMMING METHOD

Abstract

This paper explores characteristics of virtual cellular manufacturing systems, of scheduling and dispatching techniques for real time requirements and genetic algorithms for assures a high level of routing flexibility and efficiency in tasks programming for (NDJSP – non-deterministic dynamic job shop problem) systems. It introduces a programming method based in two new clustering and scheduling/dispatching techniques, respectively, applied in NDSJP manufatucting systems. Initially, the work presents basic concepts considered in the organization of cellular manufacturing systems; an approach of virtual manufacturing cells through the functional organization; the characteristics, definitions and notation used for scheduling problems; the description of more manufacturing systems scheduling and dispatching techniques; relevant aspects of evolutionary computation in specialty, the genetic algorithms. Subsequently, the work also introduces the new clustering and scheduling/dispatching techniques, the requirements and the formulas associated. The applications of the two new techniques are exemplified based on two examples picked from scientific literature and so simulated through new software called (DEVICE – Design of virtual cells). The software DEVICE was designed specialty for this research. After run more simulations, the results are obtained in a specialty structured framework. The results obtained for the proposed method application proves the powerful of this approach.