A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths (Q2757667): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/moor.26.1.31.10590 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2162870855 / rank | |||
Normal rank | |||
Latest revision as of 15:23, 19 March 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
