The Machine Duplication Problem in a Job Shop with Two Jobs (Q5689969)
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 966581
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Machine Duplication Problem in a Job Shop with Two Jobs |
scientific article; zbMATH DE number 966581 |
Statements
The Machine Duplication Problem in a Job Shop with Two Jobs (English)
0 references
15 January 1997
0 references
NP-completeness
0 references
job shop scheduling
0 references
flexible manufacturing cells
0 references
complexity of the machine duplication problem
0 references
polynomial time
0 references
heuristic
0 references
0.8157638311386108
0 references
0.8135042786598206
0 references
0.7985612750053406
0 references
0.791304349899292
0 references
