A sequential heuristic procedure for one-dimensional cutting

✍ Scribed by Miro Gradišar; Miroljub Kljajić; Gortan Resinovič; Jože Jesenko

• Publisher: Elsevier Science
• Year: 1999
• Tongue: English
• Weight: 341 KB
• Volume: 114
• Category: Article
• ISSN: 0377-2217
• DOI: 10.1016/s0377-2217(98)00140-4

✦ Synopsis

The article examines the Sequential Heuristic Procedure (SHP) for optimising one-dimensional stock cutting when all stock lengths are dierent. 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 in¯uence 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 aect material utilisation was also made.