On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming

221Citations
Citations of this article
38Readers
Mendeley users who have this article in their library.

Abstract

It IS shown that certain problems of optimal preemptive scheduling of unrelated parallel processors can be formulated and solved as hnear programming problems As a by-product of the linear programming formulations of these problems, upper bounds are obtained on the number of preempuons required for optimal schedules In particular it is shown that no more than O(m 2) preemptions are necessary, m order to schedule n jobs on m unrelated processors so as to minimize makespan. © 1978, ACM. All rights reserved.

References Powered by Scopus

Open Shop Scheduling to Minimize Finish Time

560Citations
N/AReaders
Get full text

Preemptive Scheduling of Uniform Processor Systems

167Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Optimization and approximation in deterministic sequencing and scheduling: A survey

4849Citations
N/AReaders
Get full text

Scheduling: Theory, algorithms, and systems

2339Citations
N/AReaders
Get full text

Scheduling algorithms

1719Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Lawler, E. L., & Labetoulle, J. (1978). On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming. Journal of the ACM (JACM), 25(4), 612–619. https://doi.org/10.1145/322092.322101

Readers over time

‘09‘10‘11‘12‘13‘14‘15‘16‘17‘18‘19‘20‘21‘22‘2302468

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 20

71%

Professor / Associate Prof. 7

25%

Researcher 1

4%

Readers' Discipline

Tooltip

Computer Science 13

45%

Engineering 10

34%

Business, Management and Accounting 5

17%

Agricultural and Biological Sciences 1

3%

Save time finding and organizing research with Mendeley

Sign up for free
0