A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan (Q337146)
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: A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan |
scientific article; zbMATH DE number 6650716
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan |
scientific article; zbMATH DE number 6650716 |
Statements
A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan (English)
0 references
10 November 2016
0 references
scheduling
0 references
flow shop
0 references
online
0 references
competitive ratio
0 references
0 references
0 references
0.8891040086746216
0 references
0.869361162185669
0 references
0.8523892760276794
0 references
0.8513070344924927
0 references
