Article ID: | iaor1999209 |
Country: | Netherlands |
Volume: | 91 |
Issue: | 3 |
Start Page Number: | 543 |
End Page Number: | 552 |
Publication Date: | Jun 1996 |
Journal: | European Journal of Operational Research |
Authors: | Terno Johannes, Scheithauer Guntram, Riehme Jan |
Keywords: | programming: linear |
In this paper the solution of two-stage guillotine cutting stock problems is considered. Especially such problems are under investigation where the sizes of the order demands differ in a large range. We propose a new approach dealing with such situations and compare it with the classical Gilmore–Gomory approach. We report results of extensive numerical experiments which show the advantages of the new approach.