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 the normal view instead:
scientific article; zbMATH DE number 2168011
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8725752830505371
0 references
0.8683058023452759
0 references
0.8260599970817566
0 references
0.8236449956893921
0 references
