Single machine scheduling with total tardiness criterion and convex controllable processing times

Single machine scheduling with total tardiness criterion and convex controllable processing times

0.00 Avg rating—0 Votes
Article ID: iaor20116871
Volume: 186
Issue: 1
Start Page Number: 383
End Page Number: 391
Publication Date: Jun 2011
Journal: Annals of Operations Research
Authors: , ,
Keywords: job shop, polynomial programs
Abstract:

We consider a single machine scheduling problem with total tardiness criteria and controllable job‐processing times specified by a convex resource consumption function. The objective is to have the total tardiness limited into a given range, and minimize the total resource consumption. A polynomial time algorithm of O(n 2) is presented for the special case where jobs have a common due date.

Reviews

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