A polynomial algorithm for multiprocessor scheduling with two job lengths. (Q2757667)
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: A polynomial algorithm for multiprocessor scheduling with two job lengths. |
scientific article; zbMATH DE number 1677161
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial algorithm for multiprocessor scheduling with two job lengths. |
scientific article; zbMATH DE number 1677161 |
Statements
26 November 2001
0 references
Parallel machine scheduling, high-multiplicity scheduling, polynomial algorithms, bin packing, cutting stock, Hilbert basis, integer roundup property, integer decomposition property
0 references
A polynomial algorithm for multiprocessor scheduling with two job lengths. (English)
0 references
