Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach (Q3541133): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q217074 |
||
| Property / author | |||
| Property / author: Vitaly A. Strusevich / rank | |||
Revision as of 02:19, 11 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach |
scientific article |
Statements
Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach (English)
0 references
25 November 2008
0 references
