Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
395654 | Information Sciences | 2009 | 10 Pages |
Abstract
In scheduling problems with learning effects, most of the research is based on specific learning functions. In this paper, we develop a general model with learning effects where the actual processing time of a job is not only a function of the total normal processing times of the jobs already processed, but also a function of the job’s scheduled position. In particular, it is shown that some single machine scheduling problems and m-machine permutation flowshop problems are still polynomially solvable under the proposed model. These results are significant extensions of some of the existing results on learning effects in the literature.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Yunqiang Yin, Dehua Xu, Kaibiao Sun, Hongxing Li,