PREEMPTIVE SCHEDULING ALGORITHMS WITH NESTED PROCESSING SET RESTRICTION (Q3655542): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:33, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | PREEMPTIVE SCHEDULING ALGORITHMS WITH NESTED PROCESSING SET RESTRICTION |
scientific article |
Statements
PREEMPTIVE SCHEDULING ALGORITHMS WITH NESTED PROCESSING SET RESTRICTION (English)
0 references
8 January 2010
0 references
preemptive scheduling
0 references
nested processing set
0 references
inclusive processing set
0 references
makespan minimization
0 references
polynomial-time algorithms
0 references
