Single machine due-date scheduling of jobs with decreasing start-time dependent processing times

Single machine due-date scheduling of jobs with decreasing start-time dependent processing times

0.00 Avg rating0 Votes
Article ID: iaor20071757
Country: United Kingdom
Volume: 12
Issue: 3
Start Page Number: 355
End Page Number: 366
Publication Date: May 2005
Journal: International Transactions in Operational Research
Authors: , ,
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.

Reviews

Required fields are marked *. Your email address will not be published.