Scheduling a single server and equal processing times in a two-machine flow-shop (Q2858858)
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 6229960
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling a single server and equal processing times in a two-machine flow-shop |
scientific article; zbMATH DE number 6229960 |
Statements
19 November 2013
0 references
two-machine
0 references
flow-shop
0 references
single server
0 references
complexity
0 references
\(NP\)-hardness
0 references
worst-case analysis
0 references
Scheduling a single server and equal processing times in a two-machine flow-shop (English)
0 references
0.9138109087944032
0 references
0.897182285785675
0 references
0.871871829032898
0 references
0.8682623505592346
0 references
0.8634002208709717
0 references
