A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan (Q337146): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:37, 30 January 2024
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
