Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/21284
Title: Scheduling jobs with chain precedence constraints and deteriorating jobs
Authors: Wang, JB
Wang, JJ
Ji, P 
Keywords: deteriorating jobs
Scheduling
single machine
weighted sum of squared completion times
Issue Date: 2011
Publisher: Palgrave Macmillan
Source: Journal of the Operational Research Society, 2011, v. 62, no. 9, p. 1765-1770 How to cite?
Journal: Journal of the Operational Research Society 
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.
URI: http://hdl.handle.net/10397/21284
ISSN: 0160-5682
EISSN: 1476-9360
DOI: 10.1057/jors.2010.120
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

32
Last Week
0
Last month
1
Citations as of Aug 13, 2017

WEB OF SCIENCETM
Citations

30
Last Week
0
Last month
1
Citations as of Aug 12, 2017

Page view(s)

36
Last Week
4
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.