An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems
IEEE Transactions on Computers
Scheduling Multiprocessor Tasks to Minimize Schedule Length
IEEE Transactions on Computers
Scheduling multiprocessor tasks on three dedicated processors
Information Processing Letters
Complexity of scheduling multiprocessor tasks with prespecified processor allocations
Discrete Applied Mathematics
An approximation algorithm for scheduling on three dedicated machines
Discrete Applied Mathematics
Efficiency and effectiveness of normal schedules on three dedicated processors
Selected papers from the second Krakow conference on Graph theory
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling
SIAM Journal on Computing
General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
A Simple Linear-Time Approximation Algorithm for Multi-processor Job Scheduling on Four Processors
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Scheduling Independent Multiprocessor Tasks
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
On the Approximability of Multiprocessor Task Scheduling Problems
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
| Hi-index | 0.01 |
Theoretical study of the multiprocessor job scheduling problem has made significant progress recently, which, however, seems not yet to imply practical algorithms. This paper offers new observations and introduces new techniques for the multiprocessor job scheduling problem P3|fix|Cmax. The concept of semi-normal schedulings is introduced and a very simple linear time algorithm for constructing seminormal schedulings is developed. Thorough analysis is provided in the study of semi-normal schedulings, which enables us to conclude that the proposed algorithm is an approximation algorithm of ratio 9/8 for the P3|fix|Cmax problem. This improves the previous best (practical) ratio 7/6 by Goemans. Our techniques are also useful for multiprocessor job scheduling problems on systems with more than three processors.