Scheduling jobs with chain precedence constraints and deteriorating jobs

J. B. Wang, J. J. Wang, Ping Ji

Research output: Journal article publicationJournal articleAcademic researchpeer-review

43 Citations (Scopus)


In this paper we consider a single machine scheduling problem with deteriorating jobs. By deteriorating jobs, we mean that the processing time of a job is a simple linear function of its execution starting time. For the jobs with chain precedence constraints, we prove that the weighted sum of squared completion times minimization problem with strong chains and weak chains can be solved in polynomial time, respectively.
Original languageEnglish
Pages (from-to)1765-1770
Number of pages6
JournalJournal of the Operational Research Society
Issue number9
Publication statusPublished - 1 Sep 2011


  • deteriorating jobs
  • Scheduling
  • single machine
  • weighted sum of squared completion times

ASJC Scopus subject areas

  • Management Information Systems
  • Strategy and Management
  • Management Science and Operations Research
  • Marketing

Cite this