On polynomial solvability of two multiprocessor scheduling problems (Q1806278)
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: On polynomial solvability of two multiprocessor scheduling problems |
scientific article; zbMATH DE number 1356501
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On polynomial solvability of two multiprocessor scheduling problems |
scientific article; zbMATH DE number 1356501 |
Statements
On polynomial solvability of two multiprocessor scheduling problems (English)
0 references
21 November 2001
0 references
greedy algorithm
0 references
guillotine cutting stock
0 references
multiprocessor scheduling
0 references
packing
0 references
pallet loading
0 references
