Two-stage Supply Scheduling Problem With Single Manufacturer And Multiple Customers

In this paper,we studies the two-stage supply scheduling problem with asingle manufacturer and multi-customers. In the processing stage,a set of jobsare first processed on a single machine or uniform machines and then delivered tothe customers. In the transport stage,the job need to be transported in batches.The objective function is takes into account both production and distributioncost is optimized. The thesis consists of three chapters.In chapter1,we introduce some basic concepts and preliminaries about a sin-gle machine and uniform machines scheduling problems and supply chain schedul-ing problems. Then summarize some research results of supply chain schedulingproblem.In chapter2,we studies the two-stage supply scheduling problem with a singlemanufacturer and multi-customers. In the processing stage,The job must beprocessed on uniform machines and then delivered to the customers in batches.We consider a special case,given a polynomial-time approximate algorithm,andanalyze the complexity of the algorithm. Finally We given a nature about thegeneral form of the problem.In chapter3we studies a single manufacturer and multi-customer SupplyChain scheduling problem. The problem is to find a joint schedule of productionand distribution such that an objective function that takes into account bothproduction and distribution cost is optimized. Production cost is measured bya function of the times when the jobs are delivered to the customers which isthe sum of weighted delivery times in this paper. The distribution cost of adelivery shipment consists of a fixed charge and a variable cost proportional to thetotal distance of the route and the transportation modes taken by the shipment. For two special cases of this problem a polynomial time algorithm is given andanalyzed respectively.