A note on the complexity of flow-shop scheduling with deteriorating jobs (Q629368)
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 note on the complexity of flow-shop scheduling with deteriorating jobs |
scientific article; zbMATH DE number 5862862
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the complexity of flow-shop scheduling with deteriorating jobs |
scientific article; zbMATH DE number 5862862 |
Statements
A note on the complexity of flow-shop scheduling with deteriorating jobs (English)
0 references
9 March 2011
0 references
deteriorating jobs
0 references
flow shop
0 references
makespan
0 references
NP-hardness
0 references
0.8962913155555725
0 references
0.8537708520889282
0 references
0.8486970067024231
0 references
0.8379387259483337
0 references
0.8269472718238831
0 references
