Minimizing total busy time in parallel scheduling with application to optical networks (Q708204)
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: Minimizing total busy time in parallel scheduling with application to optical networks |
scientific article; zbMATH DE number 5798128
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing total busy time in parallel scheduling with application to optical networks |
scientific article; zbMATH DE number 5798128 |
Statements
Minimizing total busy time in parallel scheduling with application to optical networks (English)
0 references
11 October 2010
0 references
scheduling
0 references
optical networks
0 references
approximation algorithms
0 references
0 references
