Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 174, Issue 2, Pages 1184-1190Publisher
ELSEVIER
DOI: 10.1016/j.ejor.2005.03.020
Keywords
scheduling; time-dependent; learning effect; single machine
Ask authors/readers for more resources
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. (c) 2005 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available