Research And Design Of Job-shop Scheduling Methods Of Non-close-joining Operations

With high-new technology especially information technology developing rapidly, customer demand changing rapidly and the economic globalization, enterprises set up a urgent claim to enhance the improvement and innovation of technology and management. The core of production and operation management is that the production shop scheduling problems can get the optimal solution efficiently, and therefore the study of Job-shop scheduling problem has important theoretical meaning and practical value.First the objective, type and the present research of Job-shop scheduling is discussed in detail. Then mathematical model and relative algorithms of this kind of problem are discussed, such as heuristic algorithm, evolution algorithm, domain search. And their disadvantages are shown.Second the existent problem of Job-Shop scheduling in practice is summarized. Then the non-close-joining operations scheduling is put forward. Finally the research of methods and the design of algorithm for the non-close-joining operations scheduling is presented.Aiming at the scheduling problem that inter-delayed operation constraints and assembly constraints are neglected in the practical production, a non-close-joining Job-shop scheduling problem is put forward. Firstly the necessity of solving this problem is described and a mathematical model is constructed. The concepts of the standard operations, the lateness operations and the expansion processing tree are proposed. Secondly a conversion strategy, which coverts the lateness constraints into the sequence constraints is designed and the effect that the exchange of model has on the complexity of algorithm is analyzed. Finally, the experiment shows that the strategy is feasibility and effective.On the basis of further study of non-close-joining scheduling problems, A dynamic Job-Shop scheduling algorithm with non-close-joining operations is put forward by improving allied critical path method (ACPM) and best fit scheduling method (BFSM): the lateness operations are scheduled firstly, and the standard operations are scheduled by ACPM and BFSM and they are compact on the key machine as soon as possible. The experiment shows that the algorithm not only can solve dynamic Job-Shop scheduling problem with non-close-joining operations better but also can be expanded to solve the dynamic Job-Shop scheduling problem with close-joining operations.Finally the data of practical production in enterprise is scheduled with the classic scheduling algorithm and the non-close-joining algorithm respectively. The experiment shows that the non-close-joining scheduling strategy is feasible and the non-close-joining scheduling algorithm is superior.