Some scheduling problems with general position-dependent and time-dependent learning effects

  • Authors:

  • Yunqiang Yin;Dehua Xu;Kaibiao Sun;Hongxing Li

  • Affiliations:

  • College of Mathematics and Information Sciences, East China Institute of Technology, Fuzhou, Jiangxi 344000, China;College of Mathematics and Information Sciences, East China Institute of Technology, Fuzhou, Jiangxi 344000, China;School of Electronic and Information Engineering, Dalian University of Technology, Dalian, Liaoning 116024, China;School of Electronic and Information Engineering, Dalian University of Technology, Dalian, Liaoning 116024, China

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2009

Quantified Score

Hi-index 0.07

Visualization

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.