Name
Title | ||
|---|---|---|
Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions |
Abstract | ||
|---|---|---|
A variant of the High Multiplicity Multiprocessor Scheduling Problem with C job lengths is considered, in which jobs can be processed only by machines not greater than a given index. When C=2, polynomial algorithms are proposed, for the feasibility version of the problem and for maximizing the number of scheduled jobs. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/s10951-008-0054-z | J. Scheduling |
Keywords | Field | DocType |
Multiprocessor scheduling,High multiplicity,Polynomial algorithms | Mathematical optimization,Multiprocessor scheduling,Computer science,Multiplicity (mathematics),Real-time computing,Rate-monotonic scheduling,Polynomial algorithm | Journal |
Volume | Issue | ISSN |
11 | 3 | 1094-6136 |
Citations | PageRank | References |
3 | 0.41 | 8 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Paolo Detti | 1 | 144 | 19.55 |