Study On Heuristic Algorithm Of Coordinating Scheduling Problem In Two-stage Manufacturing Chain Composing Of Single Machines With Delivery Constraints

With the increasing fierce of market competition, the improvement of customers’ expectations makes enterprises improve their requirements for shortening product’s life cycle and reducing production cost. Coordination is the key issue of supply chain management. The supply chain can achieve optimal operation through cooperating and coordinating different stages in a supply chain, to schedule the sequence of production and delivery.Manufacturing chain is a manufacturing network composed of many manufacturing nodes with independent processing function, which are linked by storage and transportation, to realize a complete process of a product. In a broad sense, it can be regarded as a constituent part of supply chain in enterprises consisting of many manufacturing enterprises nodes. This paper studys a two stages manufacturing chain consist of one supplier and one manufacturer with the constraint of storage and transportation. In the condition of both of the supplier and manufacturer have infinite storage areas, investigating the influence of capacity constraint in transportation and batching constraint. The research content is as follows:(1Researching the problem of manufacturing chain in the condition of transporting one job per vehicle aimed at minimizing the maximum completion time. Elaborate the characteristics of the problem, and deduce the mathematics fomula. We study the coordination scheduling problem in3cases:strategy priority to supplier, strategy priority to manufacturer and strategy based on Johnson algorithm. Design heuristic resolution, analysis the computational complexity and the low bound of problems individually, then prove them. Through compute isntances in different scale, contrast computational result and analysis the effect of3coordinated strategies.(2) Researching the problem of manufacturing chain in the condition that the travelling vehicle has number constraint for capacity aimed at minimizing the maximum completion time. The number of jobs belong to one delivery batch is no large than maximum vehicle capacity. We study the coordination scheduling problem in3coordinated strategies. Design heuristic resolution, analysis the computational complexity and the low bound of problems individually, then prove them. Through compute isntances in different scale, contrast computational result and analysis the effect of3coordinated strategies.(3)Researching the problem of manufacturing chain in the condition that travelling vehicle has size constraint of capacity aimed at minimizing the maximum completion time. The total size sum of jobs belongs to one batch is no large than maximum vehicle capacity. We study the coordination scheduling problem in3coordinated strategies. Design heuristic resolution, analysis the computational complexity and the low bound of problems individually, then prove them. Through compute isntances in different scale, contrast computational result and analysis the effect of3coordinated strategies.