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 this page instead for the normal view: Cutting-plane algorithms for preemptive uniprocessor scheduling problems |
scientific article; zbMATH DE number 7863940
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
