Scheduling jobs with simultaneous considerations of controllable processing times and learning effect

Lin Li, Ping Yan, Ping Ji, Ji Bo Wang

Research output: Journal article publicationJournal articleAcademic researchpeer-review

5 Citations (Scopus)


This paper considers a scheduling problem with general job-dependent learning curves and controllable processing times on a single machine. The objective is to determine the optimal compressions of the processing times and the optimal sequence of jobs so as to minimize some total cost functions, which consist of regular and non-regular functions and the processing time compressions. It shows that the problem can be solved by an assignment problem and thus can be solved in polynomial time. Some extensions of the problem are also given.
Original languageEnglish
Pages (from-to)1155-1162
Number of pages8
JournalNeural Computing and Applications
Issue number11
Publication statusPublished - 1 Jun 2018


  • Controllable processing times
  • Job-dependent learning curves
  • Scheduling
  • Single machine

ASJC Scopus subject areas

  • Software
  • Artificial Intelligence

Cite this