Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/18395
Title: Single-machine scheduling with deteriorating functions for job processing times
Authors: Cheng, TCE 
Lee, WC
Wu, CC
Keywords: Deteriorating jobs
Scheduling
Single machine
Issue Date: 2010
Publisher: Elsevier
Source: Applied mathematical modelling, 2010, v. 34, no. 12, p. 4171-4178 How to cite?
Journal: Applied mathematical modelling 
Abstract: In many realistic scheduling settings a job processed later consumes more time than when it is processed earlier - this phenomenon is known as scheduling with deteriorating jobs. In the literature on deteriorating job scheduling problems, majority of the research assumed that the actual job processing time of a job is a function of its starting time. In this paper we consider a new deterioration model where the actual job processing time of a job is a function of the processing times of the jobs already processed. We show that the single-machine scheduling problems to minimize the makespan and total completion time remain polynomially solvable under the proposed model. In addition, we prove that the problems to minimize the total weighted completion time, maximum lateness, and maximum tardiness are polynomially solvable under certain agreeable conditions.
URI: http://hdl.handle.net/10397/18395
ISSN: 0307-904X
DOI: 10.1016/j.apm.2010.04.014
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

26
Last Week
0
Last month
1
Citations as of Sep 10, 2017

WEB OF SCIENCETM
Citations

21
Last Week
0
Last month
1
Citations as of Sep 21, 2017

Page view(s)

48
Last Week
0
Last month
Checked on Sep 17, 2017

Google ScholarTM

Check

Altmetric



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