A polynomial time approximation scheme for general multiprocessor job scheduling

SIAM Journal on Computing

Volumn 31, Issue 1, 2001, Pages 1-17

  Chen, Jianer ^a   Miranda, Antonio ^b  

^a TEXAS A AND M UNIVERSITY   (United States)

^b BUCKNELL UNIVERSITY   (United States)

Author keywords

Approximation algorithm; Job scheduling; Multiprocessor processing; Polynomial time approximation scheme

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; SCHEDULING;

JOB SCHEDULING;

MULTIPROCESSING SYSTEMS;

EID: 0036218779     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539798348110     Document Type: Article

References (25)

1. A. K. AMOURA, E. BAMPIS, C. KENYON, AND Y. MANOUSSAKIS, Scheduling independent multiprocessor tasks, in Proceedings of the 5th Annual European Symposium on Algorithms, Graz, Austria, Lecture Notes in Comput. Sci. 1284, Springer-Verlag, Berlin, 1997, pp. 1-12.
2. S. ARORA, C. LUND, R. MOTWANI, M. SUDAN, AND M. SZEGEDY, Proof verification and the hardness of approximation problems, J. ACM, 45 (1998), pp. 501-555.
3. L. BIANCO, J. BLAZEWICZ, P. DELL'OLMO, AND M. DROZDOWSKI, Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors, Ann. Oper. Res., 58 (1995), pp. 493-517.
4. J. BLAZEWICZ, P. DELL'OLMO, M. DROZDOWSKI, AND M. SPERANZA, Scheduling multiprocessor tasks on three dedicated processors, Inform. Process. Lett., 41 (1992), pp. 275-280.
5. J. BLAZEWICZ, P. DELL'OLMO, M. DROZDOWSKI, AND M. SPERANZA, Erratum, Scheduling multiprocessor tasks on three dedicated processors, Inform. Process. Lett., 49 (1994), pp. 269-270.
6. J. BLAZEWICZ, M. DROZDOWSKI, AND J. WEGLARZ, Scheduling multiprocessor tasks to minimize scheduling length, IEEE Trans. Comput., 35 (1986), pp. 389-393.
7. J. BLAZEWICZ, W. DROZDOWSKI, AND J. WEGLARZ, Scheduling multiprocessor tasks - a survey, Internat. J. Microcomput. Appl., 13 (1994), pp. 89-97.
8. J. CHEN AND C.-Y. LEE, General multiprocessor tasks scheduling, Naval Res. Logist., 46 (1999), pp. 57-74.
9. J. CHEN AND A. MIRANDA, A polynomial time approximation scheme for general multiprocessor job scheduling, in Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC'99), Atlanta, 1999, pp. 418-427.
10. P. DELL'OLMO, M. G. SPERANZA, AND ZS. TUZA, Efficiency and effectiveness of normal schedules on three dedicated processors, Discrete Math., 164 (1997), pp. 67-79.
11. G. DOBSON AND U. KARMARKAR, Simultaneous resource scheduling to minimize weighted flow times, Oper. Res., 37 (1989), pp. 592-600.
12. J. DU AND J. Y.-T. LEUNG, Complexity of scheduling parallel task systems, SIAM J. Discrete Math., 2 (1989), pp. 473-487.
13. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, 1979.
14. M. X. GOEMANS, An approximation algorithm for scheduling on three dedicated machines, Discrete Appl. Math., 61 (1995), pp. 49-59.
15. R. L. GRAHAM, Bounds for certain multiprocessing anomalies, Bell System Tech. J., 45 (1966), pp. 1563-1581.
16. R. L. GRAHAM, D. E. KNUTH, AND O. PATASHNIK, Concrete Mathematics, Addison-Wesley, Reading, MA, 1994.
17. L. A. HALL, Approximation algorithms for scheduling, in Approximation Algorithms for NP-Hard Problems, D. S. Hochbaum, ed., PWS, Boston, 1997, pp. 1-45.
18. J. A. HOOGEVEEN, S. L. VAN DE VELDE, AND B. VELTMAN, Complexity of scheduling multiprocessor tasks with prespecified processor allocations, Discrete Appl. Math., 55 (1994), pp. 259-272.
19. J. HUANG, J. CHEN, AND S. CHEN, A simple linear time approximation algorithm for multiprocessor job scheduling on four processors, in Proceedings of the 11th Annual International Symposium on Algorithms and Computation (ISAAC 2000), Lecture Notes in Comput. Sci. 1969, Springer-Verlag, New York, 2000, pp. 60-71.
20. O. H. IBARRA AND C. E. KIM, Fast approximation algorithms for the Knapsack and sum of subset problems, J. Assoc. Comput. Mach., 22 (1975), pp. 463-468.
21. K. JANSEN AND L. PORKOLAB, General multiprocessor task scheduling: Approximate solutions in linear time, in Proceedings of the 6th Workshop on Algorithms and Data Structures (WADS '99), Lecture Notes in Comput. Sci. 1663, Springer-Verlag, New York, Berlin, 1999, pp. 110-121.
22. H. KRAWCZYK AND M. KUBALE, An approximation algorithm for diagnostic test scheduling in multicomputer systems, IEEE Trans. Comput., 34 (1985), pp. 869-872.
23. C.-Y. LEE AND X. CAI, Scheduling multiprocessor tasks without prespecified processor allocations, IIE Transactions, to appear.
24. C.-Y. LEE, L. LEI, AND M. PINEDO, Current trends in deterministic scheduling, Ann. Oper. Res., 70 (1997), pp. 1-42.
25. A. MIRANDA, Approximation Algorithms in Multiprocessor Task Scheduling, Ph.D. thesis, Department of Computer Science, Texas A&M University, College Station, TX, 1998.