Scheduling to minimize earliness and number of tardy jobs where machine idle time is allowed

Scheduling to minimize earliness and number of tardy jobs where machine idle time is allowed

0.00 Avg rating0 Votes
Article ID: iaor20041012
Country: United Kingdom
Volume: 54
Issue: 6
Start Page Number: 661
End Page Number: 664
Publication Date: Jun 2003
Journal: Journal of the Operational Research Society
Authors: , ,
Keywords: production
Abstract:

We address the bicriteria problem of minimizing the number of tardy jobs and maximum earliness on a single machine where machine idle time is allowed. We show that the problem of minimizing the number of tardy jobs while maximum earliness is kept at its minimum value of zero is polynomially solvable. We present polynomial time algorithms for the maximum earliness problem subject to no tardy jobs and the maximum earliness problem for a given set of tardy jobs. Finally, we discuss the use of the latter algorithm in generating all efficient schedules.

Reviews

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