Name
Title | ||
|---|---|---|
Preemptive open shop scheduling with multiprocessors: polynomial cases and applications |
Abstract | ||
|---|---|---|
This paper addresses a multiprocessor generalization of the preemptive open-shop scheduling problem. The set of processors is partitioned into two groups and the operations of the jobs may require either single processors in either group or simultaneously all processors from the same group. We consider two variants depending on whether preemptions are allowed at any fractional time points or only at integer time points. We reduce the former problem to solving a linear program in strongly polynomial time, while a restricted version of the second problem is solved by rounding techniques. Applications to course scheduling and hypergraph edge coloring are also discussed. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/s10951-007-0050-8 | J. Scheduling |
Keywords | Field | DocType |
Preemptive open shop scheduling,Multiprocessor operations,Polynomial time algorithms | Fixed-priority pre-emptive scheduling,Mathematical optimization,Multiprocessor scheduling,Job shop scheduling,Fair-share scheduling,Scheduling (computing),Computer science,Flow shop scheduling,Open-shop scheduling,Real-time computing,Rate-monotonic scheduling | Journal |
Volume | Issue | ISSN |
11 | 1 | 1094-6136 |
Citations | PageRank | References |
4 | 0.45 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dominique de Werra | 1 | 495 | 84.31 |
| Tamás Kis | 2 | 215 | 23.18 |
| Wieslaw Kubiak | 3 | 540 | 62.61 |