Scheduling three-operation jobs in a two-machine flow shop to minimize makespan (Q596459)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2085786
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling three-operation jobs in a two-machine flow shop to minimize makespan |
scientific article; zbMATH DE number 2085786 |
Statements
Scheduling three-operation jobs in a two-machine flow shop to minimize makespan (English)
0 references
10 August 2004
0 references
scheduling
0 references
flow shop
0 references
makespan
0 references
approximation algorithm
0 references
polynomial time approximation scheme
0 references
0.8552693724632263
0 references
0.853588342666626
0 references
0.8297240138053894
0 references
0.8260345458984375
0 references
