A note on the time complexity of machine scheduling with DeJong's learning effect

Chuanli Zhao, Ji Fang, Edwin Tai Chiu Cheng, Min Ji

Research output: Journal article publicationJournal articleAcademic researchpeer-review

6 Citations (Scopus)


Extending this research, the authors in another paper (Ji et al., 2016) gave an FPTAS for a related NP-hard problem. In this note we show that the time complexity of the two FPTASes can be improved.
Original languageEnglish
Pages (from-to)447-449
Number of pages3
JournalComputers and Industrial Engineering
Publication statusPublished - 1 Oct 2017


  • DeJong's learning effect
  • Scheduling
  • Time complexity

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)

Cite this