The Batch Scheduling Problems In Supply Chain Management

In this thesis, we consider the two stage scheduling problems with transporta-tion and batching in supply chain management. In the transportation stage, all the jobs are transported from the holding area to the batching machine by m vehicles for further processing. In the production stage, jobs are processed on batching machine. Each batch occurs a processing cost.The thesis consists of three chapters.In chapter 1, we introduce some basic concepts and preliminaries of sup-ply chain and scheduling problems. Then summarize some research results of coordination scheduling problems of transportation and production.In chapter 2, we investigate the two stage scheduling problems with trans-portation and batching to minimize the makespan and total processing cost. We prove that it is NP-hard in ordinary sense, and provide a polynomial time algo-rithm for a special case of the problem.In chapter 3, we consider a two stage supply chain scheduling problem with transportation and batching. We take the job weights into account. The objective is to minimize the sum of weighted completion times and total processing cost. We prove its NP-hardness in ordinary sense when m=1 and prove that it is strong NP-hard when there are m transportation vehicles.