Parallel machines scheduling with simple linear job deterioration and non-simultaneous machine available times

Xiao Yuan Wang, Zhili Zhou, Ping Ji, Ji Bo Wang

Research output: Journal article publicationJournal articleAcademic researchpeer-review

14 Citations (Scopus)


In this note, we deal with the parallel-machine scheduling of deteriorating jobs where the actual processing of a job is a simple linear function of the job's starting time. The jobs are available at time zero but the machines may not be available simultaneously at time zero. For the problem to minimize the logarithm of makespan, we present heuristic algorithms and analyze their worst-case error bounds.
Original languageEnglish
Pages (from-to)88-91
Number of pages4
JournalComputers and Industrial Engineering
Issue number1
Publication statusPublished - 1 Jan 2014


  • Deteriorating jobs
  • Machine availability constraint
  • Parallel machines
  • Scheduling
  • Worst-case analysis

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)

Cite this