点击次数：

论文类型：期刊论文

发表时间：2009-06-27

发表刊物：INFORMATION SCIENCES

收录刊物：SCIE、EI、SSCI、ESI高被引论文

卷号：179

期号：14

页面范围：2416-2425

ISSN号：0020-0255

关键字：Scheduling; Learning effect; Time-dependent; Position-dependent; Single-machine; Flowshop

摘要：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. (C) 2009 Elsevier Inc. All rights reserved.