Single-machine scheduling with a variable maintenance activity

Wenchang Luo, Edwin Tai Chiu Cheng, Min Ji

Research output: Journal article publicationJournal articleAcademic researchpeer-review

54 Citations (Scopus)


We consider the problem of scheduling a maintenance activity and jobs on a single machine, where the maintenance activity must start before a given deadline and the maintenance duration increases with its starting time. We provide polynomial-time algorithms to solve the problems to minimize the makespan, sum of completion times, maximum lateness, and number of tardy jobs.
Original languageEnglish
Pages (from-to)168-174
Number of pages7
JournalComputers and Industrial Engineering
Publication statusPublished - 1 Jan 2015


  • Maintenance
  • Polynomial-time algorithm
  • Scheduling
  • Single machine

ASJC Scopus subject areas

  • General Computer Science
  • General Engineering


Dive into the research topics of 'Single-machine scheduling with a variable maintenance activity'. Together they form a unique fingerprint.

Cite this