Study On Heuristic Algorithm Of Scheduling Problem Of Single Machine Manufacturing And Delivery With Time Constraints

With continuous development of global economic integration and 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. 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. One important issue in supply chain management is the scheduling problem of manufacturing and delivery. This thesis focuses on analyzing and solving scheduling problems of single machine manufacturing and delivery with time constraints. The research contents can be described as follows:(1) 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 scheduling problem of manufacturing and delivery with constraints of transportation time is studied. The objective is to determine job delivery scheduling, batches processing sequence and path selection so as to minimize the maximum completion time. The characteristics of the problem are described and the mathematics formula is deduced. Heuristic algorithms which are based on rule and search are designed. Through compute instances in different scale, computational results are contrasted and the effect of the heuristic algorithms is analyzed.(2) 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 scheduling problem of manufacturing and delivery with constraints of transportation time and inventory time is studied. The objective is to determine job delivery scheduling, batches processing sequence and path selection so as to minimize the maximum completion time. The characteristics of the problem are described. Heuristic algorithms which are based on rule and search are designed. Through compute instances in different scale, computational results are contrasted and the performance of the heuristic algorithms is analyzed.