Abstract
Five scheduling problems are considered, concerning unit-length independent tasks and uniform machines. New improved optimal algorithms are presented that can solve these problems in at most O( n log n) time, where n is the number of tasks. The existing algorithms solve most of these problems in O( n 3 ) time. Proofs of optimality of the present algorithms are included, and simple representative examples are provided that illustrate the type of results obtained
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call