The Two-Stage Assembly Scheduling Problem: Complexity and Approximation (Q4849333)
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 800719
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Two-Stage Assembly Scheduling Problem: Complexity and Approximation |
scientific article; zbMATH DE number 800719 |
Statements
The Two-Stage Assembly Scheduling Problem: Complexity and Approximation (English)
0 references
25 September 1995
0 references
two-stage assembly scheduling
0 references
makespan
0 references
NP-hard
0 references
worst-case ratio bound
0 references
0.856703519821167
0 references
0.8362048864364624
0 references
0.8341981172561646
0 references
