Scheduling jobs with chain precedence constraints and deteriorating jobs

Wang J-B (), Wang J-J and P Ji
Additional contact information
Wang J-B: Shenyang Aerospace University
Wang J-J: Dalian University of Technology
P Ji: The Hong Kong Polytechnic University
Authors registered in the RePEc Author Service: Jessie Jiaxu Wang

Journal of the Operational Research Society, 2011, vol. 62, issue 9, 1765-1770

Abstract: 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 (search for similar items in EconPapers)
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1057/jors.2010.120 Abstract (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:jorsoc:v:62:y:2011:i:9:d:10.1057_jors.2010.120

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/jors.2010.120

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().