Article ID: | iaor20001585 |
Country: | Netherlands |
Volume: | 114 |
Issue: | 3 |
Start Page Number: | 557 |
End Page Number: | 568 |
Publication Date: | May 1999 |
Journal: | European Journal of Operational Research |
Authors: | Gradiar Miro, Jesenko Joe, Resinovi Gortan, Kljaji Miroljub |
Keywords: | heuristics, optimization |
The article examines the Sequential Heuristic Procedure for optimising one-dimensional stock cutting when all stock lengths are different. In order to solve a bicriterial multidimensional knapsack problem with side constraints a lexicographic approach is applied. An item-oriented solution was found through a combination of approximations and heuristics that minimize the influence of ending conditions leading to almost optimal solutions. The computer program CUT was developed, based on the proposed algorithm. Two sample problems are presented and solved. A statistical analysis of parameters that affect material utilisation was also made.