Semi-on-line scheduling on two parallel processors with an upper bound on the items (Q1762979)
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: Semi-on-line scheduling on two parallel processors with an upper bound on the items |
scientific article; zbMATH DE number 2133716
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Semi-on-line scheduling on two parallel processors with an upper bound on the items |
scientific article; zbMATH DE number 2133716 |
Statements
Semi-on-line scheduling on two parallel processors with an upper bound on the items (English)
0 references
11 February 2005
0 references
Scheduling
0 references
Two parallel processors
0 references
Semi-on-line
0 references
Competitive analysis
0 references
0.9035139083862304
0 references
0.8996946215629578
0 references
0.853488564491272
0 references
0.8410753011703491
0 references
0.8370547890663147
0 references
