Showing papers on "Single-machine scheduling published in 1980"

A fast algorithm for multiprocessor scheduling

Abstract: The problem we discuss is that of scheduling n unit-time jobs, with release times and deadlines which are arbitrary real numbers, on m identical parallel machines. A polynomial time algorithm with time complexity O(n210g n) was first obtained. for the single machine case by Simons [5]. An alternative algorithm with the same time complexity was subsequently obtained by Carlier [1]. Most recently, an algorithm with time complexity O(n log n) has been presented in a paper by Garey, Johnson, Simons, and Tarjan [3]. In the multi-machine case the best previously known result was produced by Carlier, whose algorithm runs in time O(nm+ 210g n) [1]. However, the question of whether an algorithm exists which solves the problem in time which is polynomial in both m and n remained unanswered and was presented as an open problem in a paper by Garey, Johnson, Simons, and Tarjan [3]. We describe below an algorithm with running time O(n310g n) which schedules all the jobs while minimizing the maximum job completion time.