A simple linear-time approximation algorithm for multi-processor job scheduling on four processors

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1969, Issue , 2000, Pages 60-71

  Huang, Jingui ^a   Chen, Jianer ^a   Chen, Songqiao ^a  

^a CENTRAL SOUTH UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

MULTIPROCESSING SYSTEMS; SCHEDULING;

JOB SCHEDULING; JOB SCHEDULING PROBLEM; LINEAR-TIME APPROXIMATION; MULTI-PROCESSORS; MULTIPROCESSOR JOB SCHEDULING; THEORETICAL STUDY;

APPROXIMATION ALGORITHMS;

EID: 84949796959     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-40996-3_6     Document Type: Conference Paper

References (19)

1. A. K. Amoura, E. Bampis, C. Kenyon, and Y. Manoussakis, Scheduling independent multiprocessor tasks, Proc. 5th Ann. European Symposium on Algorithms, Lecture Notes in Computer Science 1284, (1997), pp. 1-12.
2. L. Bianco, J. Blazewicz, P. Dell'Olmo, and M. Drozdowski, Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors, Annals of Operations Research 58, (1995), pp. 493-517.
3. J. Blazewicz, P. Dell'Olmo, M. Drozdowski, and M. Speranza, Scheduling multiprocessor tasks on the three dedicated processors, Information Processing Letters 41, (1992), pp. 275-280.
4. J. Blazewicz, P. Dell'Olmo, M. Drozdowski, and M. Speranza, Corrigendum to “Scheduling multiprocessor tasks on the three dedicated processors, Information Processing Letters 41, (1992), pp. 275-280." Information Processing Letters 49, (1994), pp. 269-270.
5. J. Blazewicz, M. Drozdowski, and J. Weglarz, Scheduling multiprocessor tasks to minimize scheduling length, IEEE Transactions on Computers 35, (1986), pp. 389-393.
6. J. Blazewicz, W. Drozdowski, and J. Weglarz, Scheduling multiprocessor tasks - a survey, International Journal of Microcomputer Applications 13, (1994), pp. 89-97.
7. J. Chen and C.-Y. Lee, General multiprocessor tasks scheduling, Naval Research Logistics 46, (1999), pp. 59-74.
8. J. Chen and A. Miranda, A polynomial time approximation scheme for general multiprocessor job scheduling, Proc. 31st Annual ACM Symposium on Theory of Computing (STOC'99), (1999), pp. 418-427. Final version to appear in SIAM J. Comput.
9. P. Dell'Olmo, M. G. Speranza, Zs. Tuza, Efficiency and effectiveness of normal schedules on three dedicated processors, Discrete Mathematics 164, (1997), pp. 67-79.
10. G. Dobson and U. Karmarkar, Simultaneous resource scheduling to minimize weighted flow times, Operations Research 37, (1989), pp. 592-600.
11. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
12. M. X. Goemans, An approximation algorithm for scheduling on three dedicated machines, Discrete Applied Mathematics 61, (1995), pp. 49-59.
13. R. L. Graham, Bounds for certain multiprocessing anomalies, Bell System Technical Journal 45, (1966), pp. 1563-1581.
14. L. A. Hall, Approximation algorithms for scheduling, in D. S. Hochbaum, ed., Approximation algorithms for NP-hard problems, PWS Publishing Company, 1997, pp. 1-45.
15. J. A. Hoogeveen, S. L. van de Velde, and B. Veltman, Complexity of scheduling multiprocessor tasks with prespecified processor allocations, Discrete Applied Mathematics 55, (1994), pp. 259-272.
16. K. Jansen and L. Porkolab, General multiprocessor task scheduling: approxi- mate solutions in linear time, Lecture Notes in Computer Science 1663 (WADS'99), (1999), pp. 110-121.
17. H. Krawczyk and M. Kubale, An approximation algorithm for diagnostic test scheduling in multicomputer systems, IEEE Transactions on Computers 34, (1985), pp. 869-872.
18. C.-Y. Lee and X. Cai, Scheduling multiprocessor tasks without prespecified processor allocations, IIE Transactions, to appear.
19. C.-Y. Lee, L. Lei, and M. Pinedo, Current trends in deterministic scheduling, Annals of Operations Research 70, (1997), pp. 1-42.