Article ID Journal Published Year Pages File Type
482483 European Journal of Operational Research 2006 7 Pages PDF
Abstract

In this study, we introduce a time-dependent learning effect into a single-machine scheduling problem. The time-dependent learning effect of a job is assumed to be a function of total normal processing time of jobs scheduled in front of it. We introduce it into a single-machine scheduling problem and we show that it remains polynomially solvable for the objective, i.e., minimizing the total completion time on a single machine. Moreover, we show that the SPT-sequence is the optimal sequence in this problem.

Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)
Authors
, ,