Journal of the Operational Research Society

, Volume 62, Issue 9, pp 1765–1770

Scheduling jobs with chain precedence constraints and deteriorating jobs

Technical Note

DOI: 10.1057/jors.2010.120

Cite this article as:
Wang, JB., Wang, JJ. & Ji, P. J Oper Res Soc (2011) 62: 1765. doi:10.1057/jors.2010.120

Abstract

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.

Keywords

scheduling single machine deteriorating jobs weighted sum of squared completion times 

Copyright information

© Operational Research Society 2010

Authors and Affiliations

  1. 1.Shenyang Aerospace UniversityShenyangChina
  2. 2.Dalian University of TechnologyDalianChina
  3. 3.The Hong Kong Polytechnic UniversityKowloon, Hong KongChina

Personalised recommendations