Semi-online scheduling on two identical parallel machines with initial-lookahead information (Q6561561)
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-online scheduling on two identical parallel machines with initial-lookahead information |
scientific article; zbMATH DE number 7870965
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Semi-online scheduling on two identical parallel machines with initial-lookahead information |
scientific article; zbMATH DE number 7870965 |
Statements
Semi-online scheduling on two identical parallel machines with initial-lookahead information (English)
0 references
25 June 2024
0 references
parallel machine scheduling
0 references
semi-online algorithm
0 references
initial lookahead
0 references
competitive ratio
0 references
value of information
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9494643807411194
0 references
0.8281484842300415
0 references
0.8276046514511108
0 references
0.8252254724502563
0 references
0.8246002197265625
0 references
