Little-Preemptive Scheduling on Unrelated Processors

Journal of Mathematical Modelling and Algorithms

Volumn 1, Issue 1, 2002, Pages 43-56

  Shchepin, Evgeny ^a   Vakhania, Nodari ^b  

^a STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

^b UNIVERSIDAD AUTÓNOMA DEL ESTADO DE MORELOS   (Mexico)

Author keywords

acyclic distribution; algorithm; preemption; scheduling; unrelated processors

Indexed keywords

EID: 33748311557     PISSN: 15701166     EISSN: 15729214     Source Type: Journal    
DOI: 10.1023/A:1015674704111     Document Type: Article

References (10)

1. Gonzalez, T. and Sahni, S.: Open shop scheduling to minimize finish time, J. ACM23 (1976), 665-679.
2. Gonzalez, T. and Sahni, S.: Preemptive scheduling of uniform processor systems, J. ACM25 (1978), 92-101.
3. Kunde, M.: Nonpreemptive LP-scheduling on homogeneous multiprocessor system, SIAM J. Comput. 10 (1981), 151-173.
4. Lawler, E. L. and Labetoulle, J.: On preemptive scheduling of unrelated parallel processors by linear programming, J. ACM25 (1978), 612-619.
5. Lenstra, J. K., Shmoys, D. B. and Tardos, E.: Approximation algorithms for scheduling unrelated parallel machines, Math. Programming46 (1990), 259-271.
6. McNaughton, R.: Scheduling with deadlines and loss functions, Management Sci. 6 (1959), 1-12.
7. Potts, C. N.: Analysis of a linear programming heuristic for scheduling unrelated parallel machines, Discrete Appl. Math. 10 (1985), 155-164.
8. Shchepin, E. and Vakhania, N.: Task distributions on multiprocessor systems, In: Lecture Notes in Comput. Sci. 1872, Springer, New York, 2000, pp. 112-125.
9. Shchepin, E. and Vakhania, N.: On optimal rounding of multiprocessor distributions, Manuscript.
10. Shchepin, E. and Vakhania, N.: Tight NP-hardness results on preemptive multiprocessor and open-shop scheduling, Manuscript.