Single machine scheduling jobs with a truncated sum-of-processing-times- based learning effect

Lin Li, Sheng Wu Yang, Yu Bin Wu, Yunzhang Huo, Ping Ji

Research output: Journal article publicationJournal articleAcademic researchpeer-review

11 Citations (Scopus)


In this note, we consider a single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations. We show that even with the introduction of the proposed model to job processing times, several single-machine problems remain polynomially solvable. For the following objective functions, the discounted total weighted completion time, the maximum lateness, we present heuristics according to the corresponding problems without learning effect. We also analyze the worst-case bound of our heuristics.
Original languageEnglish
Pages (from-to)261-267
Number of pages7
JournalInternational Journal of Advanced Manufacturing Technology
Issue number1-4
Publication statusPublished - 1 Jul 2013


  • Learning effect
  • Scheduling
  • Single machine

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering
  • Control and Systems Engineering
  • Computer Science Applications
  • Software
  • Mechanical Engineering

Cite this