A framework for the complexity of high-multiplicity scheduling problems (Q2569171)
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 2215020
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A framework for the complexity of high-multiplicity scheduling problems |
scientific article; zbMATH DE number 2215020 |
Statements
A framework for the complexity of high-multiplicity scheduling problems (English)
0 references
18 October 2005
0 references
computational complexity
0 references
design of algorithms
0 references
scheduling
0 references
high multiplicity
0 references
0 references
0 references
0.8293060660362244
0 references
0.8068317770957947
0 references
0.806817352771759
0 references
0.7913156151771545
0 references
