General multiprocessor task scheduling: Approximate solutions in linear time

SIAM Journal on Computing

Volumn 35, Issue 3, 2005, Pages 519-530

  Jansen, Klaus ^a   Porkolab, Lorant ^b  

^a UNIVERSITY OF KIEL   (Germany)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Approximation algorithms; Linear programming; Scheduling problem

Indexed keywords

COMPUTATIONAL COMPLEXITY; FUNCTION EVALUATION; LINEAR PROGRAMMING; PARALLEL ALGORITHMS; POLYNOMIAL APPROXIMATION; SCHEDULING;

APPROXIMATION ALGORITHMS; LINEAR COMPLEXITY; LINEAR TIME; SCHEDULING PROBLEM;

MULTIPROCESSING SYSTEMS;

EID: 33745444339     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539799361737     Document Type: Article

References (18)

1. A. K. AMOURA, E. BAMPIS, C. KENYON, AND Y. MANOUSSAKIS, Scheduling independent multiprocessor tasks, Algorithmica, 32 (2001), pp. 247-261.
2. 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.
3. J. BLAZEWICZ, P. DELL OLMO, M. DROZDOWSKI, AND M. SPERANZA, Scheduling multiprocessor tasks on the three dedicated processors, Inform. Process. Lett., 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," Inform. Process. Lett., 49 (1994), pp. 269-270.
5. J. BLAZEWICZ, M. DRABOWSKI, AND J. WEGLARZ, Scheduling multiprocessor tasks to minimize schedule length, IEEE Trans. Comput., 35 (1986), pp. 389-393.
6. J. CHEN AND C.-Y. LEE, General multiprocessor task scheduling, Naval Res. Logist., 46 (1999), pp. 57-74.
7. J. CHEN AND A. MIRANDA, A polynomial time approximation scheme for general multiprocessor job scheduling, SIAM J. Comput., 31 (2001), pp. 1-17.
8. M. DROZDOWSKI, Scheduling multiprocessor tasks - an overview, European J. Oper. Res., 94 (1996), pp. 215-230.
9. J. Du AND J. Y.-T. LEUNG, Complexity of scheduling parallel task systems, SIAM J. Discrete Math., 2 (1989), pp. 473-487.
10. M. D. GRIGORIADIS AND L. G. KHACHIYAN, Coordination complexity of parallel price-directive decomposition, Math. Oper. Res., 21 (1996), pp. 321-340.
11. 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.
12. K. JANSEN AND L. PORKOLAB, Linear-time approximation schemes for scheduling malleable parallel tasks, Algorithmica, 32 (2002), pp. 507-520.
13. K. JANSEN AND L. PORKOLAB, Improved approximation schemes for scheduling unrelated parallel machines, Math. Oper. Res., 26 (2001), pp. 324-338.
14. K. JANSEN AND H. ZHANG, Approximation algorithms for general packing problems with modified logarithmic potential function, in Proceedings of the 2nd IFIP Conference on Theoretical Computer Science, 2002, pp. 255-266.
15. C. KENYON AND E. REMILA, A near-optimal solution to a two-dimensional cutting stock problem, Math. Oper. Res., 25 (2000), pp. 645-656.
16. W. LUDWIG AND P. TIWARI, Scheduling malleable and nonmalleable parallel tasks, in Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 1994, pp. 167-176.
17. S. A. PLOTKIN, D. B. SHMOYS, AND E. TARDOS, Fast approximation algorithms for fractional packing and covering problems, Math. Oper. Res., 20 (1995), pp. 257-301.
18. 1.5n)L) arithmetic operations, Math. Programming, 47 (1990), pp. 175-201.