Research On The Novel Models And Algorithms Of The Substantial Complicated Production Scheduling Problems

Since China’s reform and opening-up has been developed over thirty years, the manufacturing industry has become a pillar industry in the national economy of our country. In the manufacturing industry, production management is one of the most important procedures to improve the enterprise efficiency, reduce the production cost and increase the profit. With the rapid development of production management informationization construction, the modern production management information systems have been applied extensively, which resulted in that the production efficiency of enterprises have greater development While it was supposed to be the core function of many production management information systems, because production scheduling can increase the enterprise profit by improving the production efficiency, reallocating the productive resources, enhancing the equipment effectiveness, decreasing the production cycle, reducing the inventory of the work-in-process, lessening the resources consumption on the condition that the productive resources were not raised but also be used as much as possible. However, a large amount of the actual production management information systems or the production management functional modules in management information systems were lack of the detailed production scheduling system, which resulted in the failure of the detailed and optimized job schedules on the level of the shop floor. Therefore, production scheduling has become one of the bottleneck problems which are most important and most urgent to be solved.Since1950’s, the researchers had studied widely many types of production scheduling problems and had obtained lots of achievements. Nevertheless, there is still a huge gap between the theory researches and applications in practice. In recent years, both the researchers and practitioners in the field of production scheduling has took more attention to the problems which were how to improve the production efficiency in the real world by combining the academic achievements and the practical production scheduling problems as well as how to offer the stable, good quality and efficient solutions with the limited time. Based on the actual production scheduling problems, this dissertation mostly studied the flowline scheduling problems with missing operations, the uniform parallel machines scheduling problem with multi restrictions and flexible flowline scheduling problem with missing operations and uniform parallel machines. A type of method to calculate the competition time of jobs faster was discussed. Lots of local-search strategies were present and several special local-search algorithms were supposed respectively to the particular problems. The main contributions of this paper are as follows: (1) First of all, this article illustrated the background of the flowline scheduling problems with missing operations for the unique mode of production in a large workshop processing iron and steel products in addition to indicated the special sort of this problem. Then the problems with the objective function of the makespan or the total weighted completion times were discussed respectively. Both the foreign and domestic status of research on the two problems was expressed separately. The assumptions and mathematics denotations both were introduced. And for these two problems, two mathematical models based on the job sequence were formulated by0-1mixed integer problem for the first time. A modified method to calculate the completion time fast by using of the known information was provided. Moreover, based on analyzing the unreasonable aspects of the original algorithms, lots of local-search strategies and some new local-search algorithms for the each of two problems were given. Multi-groups of computational results demonstrated that the proposed algorithms were all better than the known algorithms and computing times to the large scale problems were also right to the actual scheduling circumstance in the real world. The idea of the proposed algorithms as well as the particular local-search strategies can provide researchers and practitioners some suggestions for other types of the flowline problems with missing operations.(2) For the situation where a group of parallel equipments with different running speeds in an workshop processing the automobile parts, the uniform parallel machines scheduling problem with machine available and setup times was considered. Firstly, a large number of the foreign and domestic related research work on this problem was summarized. The assumptions, mathematics denotations as well as the mathematical model based on the machine arrangement and job sequence were present. Then some usual algorithms for the considered problem in the real world were analyzed comparatively. A new local-search algorithm was proposed based on the five types of local-search strategies. As a result, the computational experimentations demonstrated the superiority of the proposed algorithm to others. The solving time can answer the demands to the actual scheduling environments even for the large scale problems. The idea of the proposed algorithm and local-search strategies can provide a guide for the similar problems in the multi-stage environments.(3) The flexible flowline scheduling problem which is more generally than the flowline scheduling problems with missing operations and parallel machines scheduling problems was studied. At first, the definition of the considered problem was ascertained. Then the foreign and domestic status of research on this problem was expressed. The assumptions, mathematics denotations as well as the mathematical model were present. A particular local-search algorithm for this problem was provided. And lots of groups of computational results demonstrated that the new algorithm can obtain the better solutions than the known one. Furthermore, the algorithm time can be controlled, which is satisfied to the need of actual production scheduling problems. In the end, the whole research work of the dissertation was summarized and the future of production scheduling problem research and its application were given.