Cutting-plane algorithms for preemptive uniprocessor scheduling problems (Q6554176)
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 7863940
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cutting-plane algorithms for preemptive uniprocessor scheduling problems |
scientific article; zbMATH DE number 7863940 |
Statements
Cutting-plane algorithms for preemptive uniprocessor scheduling problems (English)
0 references
12 June 2024
0 references
hard real-time scheduling
0 references
fixed priority
0 references
earliest deadline first
0 references
cutting planes
0 references
linear programming duality
0 references
fixed-point iteration
0 references
0.7455498576164246
0 references
0.7370316982269287
0 references
0.7368924021720886
0 references
0.7297609448432922
0 references
0.7286597490310669
0 references
