Optimal algorithms for online scheduling on parallel machines to minimize the makespan with a periodic availability constraint (Q719260)
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: Optimal algorithms for online scheduling on parallel machines to minimize the makespan with a periodic availability constraint |
scientific article; zbMATH DE number 5955882
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal algorithms for online scheduling on parallel machines to minimize the makespan with a periodic availability constraint |
scientific article; zbMATH DE number 5955882 |
Statements
Optimal algorithms for online scheduling on parallel machines to minimize the makespan with a periodic availability constraint (English)
0 references
10 October 2011
0 references
online scheduling
0 references
makespan
0 references
competitive analysis
0 references
parallel machines
0 references
periodic availability constraint
0 references
0 references
0.943027675151825
0 references
0.91730535030365
0 references
0.9094430208206176
0 references
0.8844044208526611
0 references
