Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1706356 | Applied Mathematical Modelling | 2010 | 8 Pages |
Abstract
In this paper, we bring into the scheduling field a general learning effect model where the actual processing time of a job is not only a general function of the total actual processing times of the jobs already processed, but also a general function of the job’s scheduled position. We show that the makespan minimization problem and the sum of the kth power of completion times minimization problem can be solved in polynomial time, respectively. We also show that the total weighted completion time minimization problem and the maximum lateness minimization problem can be solved in polynomial time under certain conditions.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Yunqiang Yin, Dehua Xu, Jiayin Wang,