On the complexity of adjacent resource scheduling (Q880528)
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 5153354
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of adjacent resource scheduling |
scientific article; zbMATH DE number 5153354 |
Statements
On the complexity of adjacent resource scheduling (English)
0 references
15 May 2007
0 references
combinatorial optimization
0 references
multiprocessor scheduling
0 references
strip packing
0 references
integer programming
0 references
0.729120135307312
0 references
0.722241997718811
0 references
0.7205803990364075
0 references
0.7193763256072998
0 references
