Please use this identifier to cite or link to this item:
PIRA download icon_1.1View/Download Full Text
Title: Single machine due-date scheduling of jobs with decreasing start-time dependent processing times
Authors: Cheng, TCE 
Kang, L
Ng, CTD 
Issue Date: May-2005
Source: International transactions in operational research, May 2005, v. 12, no. 3, p. 355-366
Abstract: We study the problem of scheduling jobs whose processing times are decreasing functions of their starting times. We consider the case of a single machine and a common decreasing rate for the processing times. The problem is to determine an optimal combination of the due date and schedule so as to minimize the sum of due date, earliness and tardiness penalties. We give an O(n log n) time algorithm to solve this problem.
Keywords: Single machine scheduling
Deteriorating jobs
Publisher: Blackwell Publishing
Journal: International transactions in operational research 
ISSN: 0969-6016
DOI: 10.1111/j.1475-3995.2005.501_1.x
Description: Published version at
Rights: International Transactions in Operational Research © 2005 International Federation of Operational Research Societies. The definitive version is available at
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
du22-2004-9-23.pdfPre-published version156.89 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
View full-text via PolyU eLinks SFX Query
Show full item record

Page views

Last Week
Last month
Citations as of May 28, 2023


Citations as of May 28, 2023


Last Week
Last month
Citations as of May 25, 2023

Google ScholarTM



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