A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions (Q834188)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5596687
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions |
scientific article; zbMATH DE number 5596687 |
Statements
A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions (English)
0 references
19 August 2009
0 references
preemptive scheduling
0 references
release time
0 references
inclusive processing set
0 references
makespan minimization
0 references
polynomial-time algorithms
0 references
0.8752192854881287
0 references
0.8643953204154968
0 references
0.8369357585906982
0 references
