An O(Nlog2N) algorithm for the maximum weighted tardiness problem

An O(Nlog2N) algorithm for the maximum weighted tardiness problem

0.00 Avg rating—0 Votes
Article ID: iaor19881133
Country: Netherlands
Volume: 31
Issue: 4
Start Page Number: 215
End Page Number: 219
Publication Date: May 1989
Journal: Information Processing Letters
Authors: ,
Keywords: scheduling
Abstract:

The authors give an O(nlog2n) algorithm which solves the scheduling problem of minimizing the maximum weighted tardiness. This improves the classical O(n2) algorithm of Lawler for that problem. The present algorithm makes a novel use of a data structure which originated in computational geometry.

Reviews

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