Minimizing the total completion time in a single-machine scheduling problem with a learning effect
Minimizing the total completion time in a single-machine scheduling problem with a learning effect
复制标题
DOI：
10.1016/j.apm.2010.11.006
复制
发表时间：
2011-04
影响因子：
5
通讯作者：
C. Low;Wenfen Lin
中科院分区：
文献类型：
--
作者：
C. Low;Wenfen Lin
This paper introduces a new time-dependent learning effect model into a single-machine scheduling problem. The time-dependent learning effect means that the processing time of a job is assumed to be a function of total normal processing time of jobs scheduled in front of it. In most related studies, the actual job processing time is assumed to be a function of its scheduled position when the learning effect is considered in the scheduling problem. In this paper, the actual processing time of a job is assumed to be proportionate to the length and position of the already scheduled jobs. It shows that the addressed problem remains polynomially solvable for the objectives, i.e., minimization of the total completion time and minimization of the total weighted completion time. It also shows that the shortest processing time (SPT) rule provides the optimum sequence for the addressed problem.
