Solving a real job shop scheduling problem

This work deals with a real job shop scheduling problem (jssp). The operations sequences, processing time, setup time, deadline time, due date time, priority, machine, fabric color and related technological decisions data are obtained from orders database along with a set of technological criteria about machines, which allows automatically analyzing and generating the initial scheduling sequences. These sequences are processed later by two procedures, one based on Ant Colony, and the other in Genetic Algorithms. Both procedures are integrated to a generative scheduling method and dispatching rules for big problems. In this approach is integrated technological information from: the process planning and scheduling process, in order to improve the processing time and the solution quality.