Scheduling Problems On A S-batching Machine And A Special Integrated Scheduling Of Production And Distribution

Scheduling, as a branch of operations research and applied mathematics, has its profound practical and broad application.Scheduling with learning effect and scheduling with rejection are two new scheduling models, which are attracting more and more attention recently. We take into account the learning effect and rejection in serial batching, respectively.Supply chain theory is about how to efficiently unite the suppliers, manufac-turers, retailers, customers to produce goods and distribute them to right place at right time. Our goal is to minimize the whole cost of supply chain system.Three chapters are included in this thesis.In the first chapter, we state the research development of the scheduling, supply chain scheduling, some useful information and the results we have contain in this thesis.In the second chapter, we consider two types of scheduling on a serial batch-ing machine. One is the scheduling with learning effect on a single serial machine to minimize the total completion times and the total weighted completion times, and the other is the scheduling with rejection on a single serial machine to min-imize the sum of the total completion times of the processed jobs and the total rejection penalties of the rejected ones. We present polynomial time algorithms for these problems, respectively.In the third chapter, we give the related results for the integrated scheduling of production and distribution in supply chain and consider a model of a single manufacturer and a delivery center. When all jobs have the same processing time, we provide an optimal algorithm.