location: Current position: Home >> Scientific Research >> Paper Publications

Scheduling jobs with chain precedence constraints and deteriorating jobs

Hits:

Indexed by:期刊论文

Date of Publication:2011-09-01

Journal:JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY

Included Journals:SCIE、EI、SSCI、Scopus

Volume:62

Issue:9

Page Number:1765-1770

ISSN No.:0160-5682

Key Words:scheduling; single machine; deteriorating jobs; weighted sum of squared completion times

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. Journal of the Operational Research Society (2011) 62, 1765-1770. doi:10.1057/jors.2010.120 Published online 25 August 2010

Pre One:Parallel machines scheduling with a deteriorating maintenance activity

Next One:Single-machine scheduling jobs with exponential learning functions