Operations research has a profound practical background, whose goal is im-proving efficiency and optimizing allocation of resources. Supply chain manage-ment is to allocate the resources optimally and make use of the limited resources effectively. It has a great practical significance that operations research methods are used in supply chain and practical problems are boiled down to mathemati-cal problems. In this paper, we consider supply chain scheduling problems and scheduling problems with learning effect. This thesis is composed with third chapters.In the first chapter, we introduce the background, current results and basic knowledge of scheduling and supply chain scheduling. Then we given a simple summary of our research.In the second chapter, we consider scheduling orders of the multiple manufac-turers and one distribution center of supply chain model, objective is to minimize the delivery time plus the total costs. We give an algorithm and analysis its worst performance.In the third chapter, the scheduling problems with learning effect are consid-ered, the objective function is to minimize the total earliness award and tardiness penalty. Several optimal algorithms are provided in the cases of the processing times of the jobs are non-identical and identical respectively.
|