Complexity of mixed shop scheduling problems: A survey (Q1969835)
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: Complexity of mixed shop scheduling problems: A survey |
scientific article; zbMATH DE number 1417443
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of mixed shop scheduling problems: A survey |
scientific article; zbMATH DE number 1417443 |
Statements
Complexity of mixed shop scheduling problems: A survey (English)
0 references
19 March 2000
0 references
optimal scheduling
0 references
mixture of job and open shops
0 references
polynomial algorithm
0 references
NP-hard problem
0 references
0 references
0 references
0 references
