The complexity of customer order scheduling problems on parallel machines (Q1777163)
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 customer order scheduling problems on parallel machines |
scientific article; zbMATH DE number 2168011
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of customer order scheduling problems on parallel machines |
scientific article; zbMATH DE number 2168011 |
Statements
The complexity of customer order scheduling problems on parallel machines (English)
0 references
12 May 2005
0 references
Batch scheduling
0 references
Kitting
0 references
Customer order scheduling
0 references
Computational complexity
0 references
0 references
