On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming

Journal of the ACM (JACM)

Volumn 25, Issue 4, 1978, Pages 612-619

  Lawler, E L ^a   Labetoulle, J ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b IRIA   (France)

Author keywords

linear programmmg; parallel processors; preemptive scheduling

Indexed keywords

MATHEMATICAL PROGRAMMING, LINEAR;

COMPUTER SYSTEMS, DIGITAL;

EID: 0018020599     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/322092.322101     Document Type: Article

References (5)

1. Gonzalez, T, and Sahni, S Open shop scheduling to minimize finish time J. ACM 23, 4 (Oct 1976), 665-679.
2. Gonzalez, T, and Sahni, S Preemptive scheduling of uniform processor systems J ACM 25, 1 (Jan 1978), 92-101.
3. Sahni, S, and Gonzalez, T Preemptive scheduling of two unrelated machines Tech. Rep 76-16, Comptr Sci Dept, U of Minnesota, Minneapolis, Minn, Nov 1976.
4. McNaughton, R Sequencing with deadlines and loss functions Manage Sci 6 (1959), 1-12.
5. Stern, H I Minimizing makespan for independent jobs on nonidentical parallel machines—An optimal procedure Tech Rep, Dept of Industrial Eng and Mgt, Ben-Gunon U of the Negev, Beer-Sheva, Israel, March 1976.