The computational complexities of two multi-purpose machines scheduling problem with setup times (Q3641981)
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 computational complexities of two multi-purpose machines scheduling problem with setup times |
scientific article; zbMATH DE number 5631246
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The computational complexities of two multi-purpose machines scheduling problem with setup times |
scientific article; zbMATH DE number 5631246 |
Statements
11 November 2009
0 references
scheduling
0 references
computational complexity
0 references
polynomial algorithm
0 references
multi-purpose machine
0 references
setup time
0 references
0.8718046545982361
0 references
0.8416427373886108
0 references
0.8264943957328796
0 references
0.8207993507385254
0 references
0.8188284635543823
0 references
