A note on single-machine scheduling with job-dependent learning effects
A note on single-machine scheduling with job-dependent learning effects
复制标题
DOI：
10.1016/j.ejor.2010.06.022
复制
发表时间：
2010-12
期刊：
影响因子：
--
通讯作者：
Christos Koulamas
中科院分区：
文献类型：
--
作者：
Christos Koulamas
Mosheiov and Sidney (2003) showed that the makespan minimization problem with job-dependent learning effects can be formulated as an assignment problem and solved in O(n3) time. We show that this problem can be solved in O(nlogn) time by sequencing the jobs according to the shortest processing time (SPT) order if we utilize the observation that the job-dependent learning rates are correlated with the level of sophistication of the jobs and assume that these rates are bounded from below. The optimality of the SPT sequence is also preserved when the job-dependent learning rates are inversely correlated with the level of sophistication of the jobs and bounded from above.
