The single-machine scheduling problems with deteriorating jobs and learning effect  

作　　者：CHENG Ming-bao SUN Shi-jie 

机构地区：[1]Department of Mathematics, Shanghai University, Shanghai 200444, China

出　　处：《Journal of Zhejiang University-Science A(Applied Physics & Engineering)》2006年第4期597-601,共5页浙江大学学报（英文版）A辑（应用物理与工程）

摘　　要：In this paper we consider a single-machine scheduling model with deteriorating jobs and simultaneous learning, and we introduce polynomial solutions for single machine makespan minimization, total flow times minimization and maximum lateness minimization corresponding to the first and second special cases of our model under some agreeable conditions. However, corresponding to the third special case of our model, we show that the optimal schedules may be different from those of the classical version for the above objective functions.In this paper we consider a single-machine scheduling model with deteriorating jobs and simultaneous learning, and we introduce polynomial solutions for single machine makespan minimization, total flow times minimization and maximum lateness minimization corresponding to the first and second special cases of our model under some agreeable conditions. However, corresponding to the third special case of our model, we show that the optimal schedules may be different from those of the classical version for the above objective functions.

关 键 词：SCHEDULING SINGLE-MACHINE Learning effect Deteriorating jobs 

分 类 号：O223[理学—运筹学与控制论]