The complexity of two-job shop problems with multi-purpose unrelated machines. (Q1410331)
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: The complexity of two-job shop problems with multi-purpose unrelated machines. |
scientific article; zbMATH DE number 1992619
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of two-job shop problems with multi-purpose unrelated machines. |
scientific article; zbMATH DE number 1992619 |
Statements
The complexity of two-job shop problems with multi-purpose unrelated machines. (English)
0 references
14 October 2003
0 references
Shop scheduling
0 references
Multi-purpose unrelated machines
0 references
Complexity analysis
0 references
0.8529669642448425
0 references
0.8506414890289307
0 references
0.8492532968521118
0 references
0.8491590023040771
0 references
