A note on single-machine scheduling with job-dependent learning effects
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(nlog n) 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.
Year of publication: |
2010
|
---|---|
Authors: | Koulamas, Christos |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 207.2010, 2, p. 1142-1143
|
Publisher: |
Elsevier |
Subject: | Scheduling Single-machine Learning |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
An improved delayed-start LPT algorithm for a partition problem on two identical parallel machines
Koulamas, Christos, (2008)
-
A note on the effects of downstream efficiency on upstream pricing
Koulamas, Christos, (2009)
-
E-business : a review of research published in production and operations management (1992-2008)
Gupta, Sushil K., (2009)
- More ...