A note on the complexity of the concurrent open shop problem (Q880556)
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: A note on the complexity of the concurrent open shop problem |
scientific article; zbMATH DE number 5153372
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the complexity of the concurrent open shop problem |
scientific article; zbMATH DE number 5153372 |
Statements
A note on the complexity of the concurrent open shop problem (English)
0 references
15 May 2007
0 references
Order scheduling
0 references
Total completion time
0 references
Complexity
0 references
Internal and external performance measures
0 references
0 references
