A sequential heuristic procedure for one-dimensional cutting

DOI10.1016/S0377-2217(98)00140-4zbMath0938.90058MaRDI QIDQ1124716

Jože Jesenko, Gortan Resinovič, Miroljub Kljajić, Miro Gradisar

Publication date: 27 June 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

sequential heuristic procedurebicriterial multidimensional knapsack problemone-dimensional stock cutting

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (19)

An algorithm for the determination of optimal cutting patterns ⋮ An improved typology of cutting and packing problems ⋮ Alternative configurations for cutting machines in a tube cutting mill ⋮ Roll cutting in the curtain industry, or: a well-solvable allocation problem ⋮ One-dimensional cutting stock optimization in consecutive time periods ⋮ A heuristic for the one-dimensional cutting stock problem with usable leftover ⋮ One-dimensional stock cutting: optimization of usable leftovers in consecutive orders ⋮ An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem ⋮ A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem ⋮ An exact model for a slitting problem in the steel industry ⋮ Simultaneously determining the mix of space launch vehicles and the assignment of satellites to rockets ⋮ A combined approach to the solution to the general one-dimensional cutting stock problem ⋮ Renovation of the cutting stock process ⋮ Two-stage two-dimensional guillotine cutting stock problems with usable leftover ⋮ The one-dimensional cutting stock problem with usable leftover - a heuristic approach ⋮ Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths ⋮ Evaluation of algorithms for one-dimensional cutting ⋮ One-dimensional cutting stock problem to minimize the number of different patterns ⋮ The one-dimensional cutting stock problem with usable leftovers -- a survey

Cites Work

• Unnamed Item
• Cutting and packing. Special issue
• Cutting stock problems and solution procedures
• Optimization of roll cutting in clothing industry
• A two-phase roll cutting problem
• A typology of cutting and packing problems
• One-dimensional cutting stock decisions for rolls with multiple quality grades
• A Linear Programming Approach to the Cutting-Stock Problem
• Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
• A Linear Programming Approach to the Cutting Stock Problem—Part II

This page was built for publication: A sequential heuristic procedure for one-dimensional cutting