A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths (Q2757667): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:24, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths |
scientific article |
Statements
A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths (English)
0 references
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
