Delivery To Determine The Conditions Of Water-in-time Job-shop Scheduling Problem

The development of modern supply chain, so that more and more closely the links between enterprises, small-volume, multi-batch mode of production as well as integration with delivery required to improve the urgent need for a new assembly line production system. Therefore, time-based production technologies for the Flow Shop scheduling problem also has important significance, according to manufacturing needs of a reasonable allocation of manufacturing resources, and thus achieve the rational use of manufacturing resources and increase economic efficiency. So this paper mainly research on the following aspects.1. JIT-based production flow shop scheduling problems are summarized below. The second chapter were classified from the shop scheduling, shop floor scheduling methods, flow shop scheduling problem of classification, flow shop scheduling problem of existing solutions, stand-alone under the conditions of flow shop scheduling problem and so on flowshop scheduling problem were also discussed. One stand-alone operation under the conditions of flow shop scheduling problem is the author's thesis in graduate study and research during the content, build a new penalty factor model, and simulated annealing algorithm to solve the problems of this type.2. In the third chapter of the on time delivery system established under the conditions of flow shop scheduling problem, the problem does not contain parallel machine. In this paper, from simple to complex, section I first study the single-mode variety of products for flow shop scheduling problem, a key process based on heuristic algorithms, a better solution to the problem. Section II studies can produce more varieties of product flow shop scheduling problem, to solve the problem, I thought the first time using dynamic programming to solve the system time under the condition of flow shop scheduling problem,Ideas to solve the problem of key process Shiyi heuristic algorithm based on system conditions, and then use mathematical programming method to find the longest path of the network diagram. From the article cited examples can be seen that a good mathematical programming method to solve the problem.3. System for the next time hybrid flowshop scheduling problem. The method of thinking is the first key process of heuristic obtained using an optimized solution, and then combined with the traditional simulated annealing algorithm to solve the problem model, the simulated annealing algorithm to overcome the disadvantage of slow convergence, more flexible, able to solve traditional flow shop and other production constraints flow shop model. For enterprises to reduce logistics, storage costs provides a simple and feasible solutions.