Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints (Q814116)
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: Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints |
scientific article; zbMATH DE number 5003149
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints |
scientific article; zbMATH DE number 5003149 |
Statements
Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints (English)
0 references
2 February 2006
0 references
scheduling
0 references
flexible flowshop
0 references
availability constraints
0 references
approximability
0 references
approximation algorithms
0 references
worst-case analysis
0 references
0 references
0 references
0 references
0.94683385
0 references
0.9332844
0 references
0.9325527
0 references
0.9218621
0 references
0.9207009
0 references
0 references
0.9078573
0 references
