Scheduling jobs with chain precedence constraints and deteriorating jobs
- First Online:
- Cite this article as:
- Wang, JB., Wang, JJ. & Ji, P. J Oper Res Soc (2011) 62: 1765. doi:10.1057/jors.2010.120
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.