Online, semi-online algorithms for machine covering with non-simultaneous machine available time (Q5456087)
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: Online, semi-online algorithms for machine covering with non-simultaneous machine available time |
scientific article; zbMATH DE number 5260691
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Online, semi-online algorithms for machine covering with non-simultaneous machine available time |
scientific article; zbMATH DE number 5260691 |
Statements
4 April 2008
0 references
parallel machine scheduling problem
0 references
worst-case ratio
0 references
optimal algorithm
0 references
0.9388275742530824
0 references
0.9108548164367676
0 references
0.8940814733505249
0 references
