Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/20043
Title: Three scheduling problems with deteriorating jobs to minimize the total completion time
Authors: Ng, CT 
Cheng, TCE 
Bachman, A
Janiak, A
Keywords: Algorithms
Dynamic programming
Single machine scheduling
Start time dependent processing times
Total completion time
Issue Date: 2002
Source: Information processing letters, 2002, v. 81, no. 6, p. 327-333 How to cite?
Journal: Information Processing Letters 
Abstract: In this paper, three scheduling problems with deteriorating jobs to minimize the total completion time on a single machine are investigated. By a deteriorating job, we mean that the processing time of the job is a function of its execution start time. The three problems correspond to three different decreasing linear functions, whose increasing counterparts have been studied in the literature. Some basic properties of the three problems are proved. Based on these properties, two of the problems are solved in O(nlogn) time, where n is the number of jobs. A pseudopolynomial time algorithm is constructed to solve the third problem using dynamic programming. Finally, a comparison between the problems with job processing times being decreasing and increasing linear functions of their start times is presented, which shows that the decreasing and increasing linear models of job processing times seem to be closely related to each other.
URI: http://hdl.handle.net/10397/20043
ISSN: 0020-0190
DOI: 10.1016/S0020-0190(01)00244-7
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

77
Last Week
1
Last month
0
Citations as of Jul 30, 2017

WEB OF SCIENCETM
Citations

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

Page view(s)

60
Last Week
7
Last month
Checked on Aug 14, 2017

Google ScholarTM

Check

Altmetric



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