On some polynomial solvable cases of cutting stock, pallet loading and scheduling problems (Q4233348)
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 1264416
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On some polynomial solvable cases of cutting stock, pallet loading and scheduling problems |
scientific article; zbMATH DE number 1264416 |
Statements
16 March 1999
0 references
cutting stock
0 references
pallet loading
0 references
multiprocessor scheduling
0 references
guillotine patterns
0 references
NP-hard
0 references
polynomial time
0 references
0.8604501485824585
0 references
0.8430272936820984
0 references
0.8379726409912109
0 references
0.8044447302818298
0 references
0.7990837097167969
0 references
On some polynomial solvable cases of cutting stock, pallet loading and scheduling problems (English)
0 references
