Research On Multi-Resource Constrained Job Shop Optimal Scheduling

As a popular research realm in manufacture system, Job Shop Scheduling is one of the most difficult problems in theoretic. The main task in scheduling, in terms of produce target and constraints, is to determine the precise process, time, equipment and operation for every process object. An eminent scheduling strategy can improve the optimization and economic efficiency of produce system.Usually, classical job shop scheduling hypothesis to need only machine resource to process workpiece. However, not only machine is needed to process workpiece, but also additional resources are needed in the actual problem. On the other hand, there is mutil-resource constrained when jobs are scheduling because of the limitation of workshop resources. So it is more complicated for mutil-resource constrained job shop scheduling problem than for classical job shop scheduling problem. Both classical job shop scheduling problem and mutil-resource constrained job shop scheduling problem are belong to nondeterministic polynomial hard problem. The key of solving problem is model and algorithm. It can promote greatly the utilization ratio of resources and the production efficiency with effective scheduling algorithm. Therefore, it has important theoretical and practical significance to research mutil-resource constrained job shop scheduling problem.First of all, this paper discussed the research purpose and significance of mutil-resource constrained job shop scheduling. The trend of the domestic and overseas research of job shop scheduling and the research methods in this domain are analyzed. The basic theories about job shop scheduling are studied. Mutil-resource and mutil-resource constrained job shop scheduling on the basis of classical shop scheduling and increasing condition about resource constraints are described.Secondly, we took machine and mould as mutil-resource example and built the model of mutil-resource constrained job shop scheduling. In this research field, it is a none-standard Job Shop Scheduling Problem. An three-level optimizing algorithm called job level, equipment level and optimization level heuristic arithmetic is designed for settling this problem in this article. Some examples are used to test the feasibility and the validity of this algorithm. The results indicate that the algorithm has good performance of object optimizing and calculating speed.Finally, On the basis of research theories, A mutil-resource constrained job shop scheduling software system is developed. There are four function modules in this system, which includes management for account number and permission, management for basic data, job scheduling and information display in workshop. At the same time some examples for application of system are also given.