Study On Coordinating Scheduling Problem Of Two-stage Manufacturing Chain Composing Of Single Machines With Intermediate Buffer

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, while in the narrow sense, it can be regarded as a process chain of different processing operations when produce a specific product in the internal of some manufacturing enterprise. With the increasingly fierce of the market competition, the requirements of enterprises to shorten the products’production cycle and reduce the production cost have becoming increasingly demanded. It is of great theoretical significance and application value to arrange production and distribution order through cooperating and coordinating in different stages of a supply chain to achieve optimal operation.We studied the coordinated scheduling problem of a two-stage manufacturing chain with single machine and capacity constraints of intermediate buffer. As the influence of the transportation constraints, whether it has storage area or not and the position of the storage area to the objective function, the processing sequence of jobs and batching transportation is considered, the research content is as follows:(1) Researching the condition thatthere is no storage areas existed in both sides of supplier and manufacturer. The objective is to minimize the sum of flow time. According to the characteristics of the problem, we develop a mathematical model and give genetic algorithm and cultural algorithm to solve this problem. Design of algorithms is expounded, which includes the method of coding, population initialization, the construction of fitness function and repairing operator. The problem instances of different sizes were calculated, and the results were analyzed.(2) Researching the condition that there is one storage area existed in one side of supplier or manufacturer. Using genetic algorithm and cultural algorithm to solve the two problems of only supplier has a storage area and only manufacturer has a storage area. Expounding the design of the algorithms, including the method of coding, population initialization, the construction of fitness function and repairing operator. The problem instances of different sizes were calculated, and the results were analyzed. (3) Researching the condition that there are two storage areas existed in both sides of supplier and manufacturer. Using genetic algorithm and cultural algorithm to solve the problem. The problem instances of different sizes were calculated, and the results were analyzed.