Please use this identifier to cite or link to this item:
Title: Single machine due-date scheduling of jobs with decreasing start-time dependent processing times
Authors: Cheng, T. C. Edwin
Kang, Liying
Ng, Chi-to Daniel
Subjects: Single machine scheduling
Deteriorating jobs
Issue Date: May-2005
Publisher: Blackwell Publishing
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.
Description: Published version at
Rights: International Transactions in Operational Research © 2005 International Federation of Operational Research Societies. The definitive version is available at
Type: Journal/Magazine Article
DOI: 10.1111/j.1475-3995.2005.501_1.x
ISSN: 0969-6016
Appears in Collections:LMS Journal/Magazine Articles

Files in This Item:
File Description SizeFormat 
du22-2004-9-23.pdfPre-published version156.89 kBAdobe PDFView/Open

All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated. No item in the PolyU IR may be reproduced for commercial or resale purposes.