两类加工时间可变现代排序问题.pdf

Two modern scheduling problems with varying processing times Abstract Scheduling is an important problem in combinatorial optimization. The processing time of a job is a fixed constant in the classical scheduling. However, in the real word, the processing time of the job may be dependent on its position in a schedule, its starting time or characteristics. Modern scheduling problem with varying processing times is the expansion of the classical scheduling problem and more and more cause the researchers interest. In the paper, we study two modern scheduling problems with varying processing times, the structure is following: Firstly, we introduce the background knowledge of scheduling problem and works in this paper. In the second chapter, for the parallel machines scheduling model with learning effect, we discuss two problems which objective functions are minimizing the sum of earliness and tardiness penalties and minimizing the weighted sum of earliness and number of tardy jobs. For the two problems, we present a polynomial time algorithm, respectively. In the third chapter, we consider the problem of due-window assignment and scheduling model of a job-dependent aging effect and a maintenance activity on a single machine. In this model, the maintenance activity restores the processing efficiency of the machine. The objective is to minimize the total flow-time, earliness, tardiness and due-window costs. For the due-window starting time is a given parameter, we provide a polynomial-time algorithm. In the forth chapter, we study the problem of the processing time of a job is dependent on its starting time in a schedule. Firstly, the