Flowshop scheduling of deteriorating jobs on dominating machines

Chi To Ng, J. B. Wang, Edwin Tai Chiu Cheng, S. S. Lam

Research output: Journal article publicationJournal articleAcademic researchpeer-review

17 Citations (Scopus)


In this paper we consider the general, no-wait and no-idle permutation flowshop scheduling problem with deteriorating jobs, i.e.; jobs whose processing times are increasing functions of their starting times. We assume a linear deterioration function with identical increasing rates for all the jobs and there are some dominating relationships between the machines. We show that the problems to minimize the makespan and the total completion time remain polynomially solvable when deterioration is considered, although these problems are more complicated than their classical counterparts without deterioration.
Original languageEnglish
Pages (from-to)647-654
Number of pages8
JournalComputers and Industrial Engineering
Issue number3
Publication statusPublished - 1 Oct 2011


  • Deteriorating jobs
  • Dominating machines
  • Flowshop
  • No-idle
  • No-wait
  • Scheduling

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)

Cite this