SCHEDULING JOBS WITH GENERAL LEARNING FUNCTIONS  

作　　者：Li-Yan WANG Jian-Jun WANG Ji-Bo WANG En-Min FENG 

机构地区：[1]School of Science, Shenyang Aerospace University, Shenyang, 110136, China [2]School of Mathematical Sciences, Dalian University of Technology, Dalian, 116024, China [3]School of Management, Dalian University of Technology, Dalian, 116024, China

出　　处：《Journal of Systems Science and Systems Engineering》2011年第1期119-125,共7页系统科学与系统工程学报（英文版）

摘　　要：This paper deals with single-machine scheduling problems with a more general learning effect based on sum-of-processing-time. In this study, sum-of-processing-time-based learning effect means that the processing time of a job is defined by a decreasing function of the total normal processing time of jobs that come before it in the sequence. Results show that even with the introduction of the sum-of-processing-time-based learning effect to job processing times, single-machine makespan minimization problems remain polynomially solvable. The curves of the optimal schedule of a total completion time minimization problem are V-shaped with respect to iob normal orocessinz times.This paper deals with single-machine scheduling problems with a more general learning effect based on sum-of-processing-time. In this study, sum-of-processing-time-based learning effect means that the processing time of a job is defined by a decreasing function of the total normal processing time of jobs that come before it in the sequence. Results show that even with the introduction of the sum-of-processing-time-based learning effect to job processing times, single-machine makespan minimization problems remain polynomially solvable. The curves of the optimal schedule of a total completion time minimization problem are V-shaped with respect to iob normal orocessinz times.

关 键 词：SCHEDULING single machine learning effect MAKESPAN total completion time 

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