Minimizing the weighted number of tardy task units

Minimizing the weighted number of tardy task units

0.00 Avg rating0 Votes
Article ID: iaor1995942
Country: Netherlands
Volume: 51
Issue: 3
Start Page Number: 307
End Page Number: 316
Publication Date: Jul 1994
Journal: Discrete Applied Mathematics
Authors: , ,
Abstract:

The problem of minimizing the weighted number of tardy task units on a single processor is considered. The authors give an O(nlogn+kn)-time algorithm for a set of n tasks with k distinct weights. The relation of this problem with that of minimizing the total weighted error in the imprecise computation model is also discussed.

Reviews

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