LP rounding and combinatorial algorithms for minimizing active and busy time (Q1702663)
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 6845353
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | LP rounding and combinatorial algorithms for minimizing active and busy time |
scientific article; zbMATH DE number 6845353 |
Statements
LP rounding and combinatorial algorithms for minimizing active and busy time (English)
0 references
28 February 2018
0 references
active time
0 references
busy time
0 references
batch scheduling
0 references
0.9325925
0 references
0.8744137
0 references
0.8601252
0 references
0.8492838
0 references
0.84240127
0 references
0.84094995
0 references
0.84071267
0 references
0.8396951
0 references
0.8382847
0 references
