Single Machine Outsourcing Supply Chain Sequencing Problem With Workpiece Deterioration

Manufacturing company always focuses on supply chain management research. Supply chain scheduling is the scheduling theory applied to the actual supply chain management.According to the theory, manufacturers plan production processing and distribution in the supply chain problems. In classical scheduling problem, the processing time of jobs is known and fixed. But in the actual production process, there will be emerged the phenomenon that processing time increases with delay of the starting time. At the same time, in a flexible supply chain, the manufacturer does not accept all the orders from customers, according to the needs of enterprise, manufacturers often outsource or refuse part of the jobs in order to obtain greater profit space. Not only that, manufacturers delivery the finished jobs to customers timely. As a result, manufacturers how to choose to accept the work set, how to arrange to accept the work set processing, production and distribution problems, and on this basis, the minimization hold goods cost, distribution cost and outsourcing cost, the sum is particularly important. The structure of this paper is organized as follows:In chapter 1, this chapter mainly introduces about the basic knowledge of scheduling problems, the main concepts and basic common sense in combinatorial optimization, and briefly introduces the machine with deteriorating effect, scheduling problem can be out-sourced, and finally a brief explanation about the problem of the research status and the main result of this paper.In chapter 2, this chapter mainly considers when the outsourcing cost is unlimited, supply chain scheduling problem with deteriorating effect of single machine: manufacturers will get all jobs at zero time, each job has the same basic processing time, but the actual processing time of a job is a simple linear increasing function of its starting time. Each job can be processing or choose to outsource to a third party manufacturers, at the same time, the jobs outsoured need to pay the corresponding cost. Manufacturers need to arrange vehicles for the jobs finished delivery to the client in batches. The jobs delivered together in the same vehicle called a batch. The departure time of each piece of job is the completion time of the last piece of job. We assume that the capacity of each batch is unlimited. we consider the outsourcing cost without limit. How do we minimization the sum of freight costs, distribution costs and total cost of outsourcing. At this time the problem can be converted into the shortest path problem in polynomial time, so proved this problem belongs to P problem. And on the basis of the above problems, we study when the transport to the total number of batch has limit,the objective function is the sum of outsourcing cost and total cost of goods.In chapter 3, based on the first problem of the second chapter, we will consider in the case of outsourcing cost limited, the objective function is freight costs and distribution costs of accepted jobs. We put forward the pseudo-polynomial time algorithm based on dynamic programming algorithm.