Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects

Edwin Tai Chiu Cheng, Chin Chia Wu, Wen Chiung Lee

Research output: Journal article publicationJournal articleAcademic researchpeer-review

140 Citations (Scopus)


In this paper we introduce a new scheduling model with learning effects in which the actual processing time of a job is a function of the total normal processing times of the jobs already processed and of the job's scheduled position. We show that the single-machine problems to minimize makespan and total completion time are polynomially solvable. In addition, we show that the problems to minimize total weighted completion time and maximum lateness are polynomially solvable under certain agreeable conditions. Finally, we present polynomial-time optimal solutions for some special cases of the m-machine flowshop problems to minimize makespan and total completion time.
Original languageEnglish
Pages (from-to)2476-2487
Number of pages12
JournalInformation Sciences
Issue number11
Publication statusPublished - 1 Jun 2008


  • Flowshop
  • Learning effect
  • Scheduling
  • Single-machine

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Theoretical Computer Science
  • Software
  • Computer Science Applications
  • Information Systems and Management
  • Artificial Intelligence

Cite this