Coordination Scheduling Problem Of Single Machine Manufacturing And Delivery With Time Constraints

With rapid development of the global economy, it is very important for enterprise to reduce cost, improve customers’ service and respond to market quickly. So, how to perform coordination management among different business partners becomes an important problem, and has been a hot research field about supply chain management.Coordination is one of kernel concepts about supply chain management.And, one important issue in coordination management is the coordination of activities between production and delivery.This thesis focuses on modeling and solving coordination scheduling problems of single machine manufacturing and delivery with time constraints.The problems can be described as follows:First,Considering a two-stage supply chain system composed of one machine and multiple customers, jobs are transported to customers by a capacity limited vehicle in batches. A coordinating scheduling problem of manufacturing and delivery with constraints of transportation time is studied. The problem which one delivery batch belonged to multiple customers is studied.The objective is to determine job delivery scheduling and batches processing sequence and path selection so as to minimize the maximum completion time. According to characteristics of the problem, mathematical model is built.The heuristic algorithm and the particle swarm optimization (PSO) algorithm and the cultural algorithm (CA) are proposed and stated in detail. The parameters of the algorithms are analyzed.The particle swarm optimization (PSO) with different creation strategies for the initial population and the cultural algorithm (CA) with different crossover modes based on genetic algorithm (GA) are stated in detail.Some calculating experiments are performed on different problem instances,the calculating results are presented and discussed,last feasibilities and stabilities of the algorithms are verified. Second,Considering a two-stage supply chain system composed of one machine and multiple customers, jobs are transported to customers by a capacity limited vehicle in batches. A coordinating scheduling problem of manufacturing and delivery with constraints of transportation and inventory time is studied.And the problems which one delivery batch belonged to single customer/multiple customers are studied. The objective is to determine job delivery scheduling and batches processing sequence and path selection so as to minimize the maximum completion time. According to characteristics of the problem, mathematical model is built.The heuristic algorithm and the particle swarm optimization (PSO) algorithm and the cultural algorithm (CA) are proposed and stated in detail. The parameters of the algorithms are analyzed.The particle swarm optimization (PSO) with different creation strategies for the initial population and the cultural algorithm (CA) with different crossover modes based on genetic algorithm (GA) are stated in detail. Some calculating experiments are performed on different problem instances,the calculating results are presented and discussed,last feasibilities and stabilities of the algorithms are verified.The results and values of batchs for single customer are better than that of batchs for multiple customers.