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
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan |
scientific article |
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
