A new prototype system for optimized job shop scheduling

Optimal scheduling of shopfloor activities in an environment of discrete part manufacturing is discussed. The scheduling problem is a well known NP complete one. The main part, the sequencing problem, has been tackled using two techniques: virtual resources identification and taboo search heuristics. The first approach allowed the authors to reduce the complexity of the sequencing from a job shop to a general flow shop problem. On the other hand, the search for an optimal solution, with respect to a fixed strategy, has been achieved via the taboo search. A synthesis of the results of a large number of tests is presented as well as the results of an application to a real case. The latter is shown in comparison with the output of the system being presently used in the examined factory.