A sequential heuristic procedure for one-dimensional cutting

From MaRDI portal
Publication:1124716

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)




Related Items (19)

An algorithm for the determination of optimal cutting patternsAn improved typology of cutting and packing problemsAlternative configurations for cutting machines in a tube cutting millRoll cutting in the curtain industry, or: a well-solvable allocation problemOne-dimensional cutting stock optimization in consecutive time periodsA heuristic for the one-dimensional cutting stock problem with usable leftoverOne-dimensional stock cutting: optimization of usable leftovers in consecutive ordersAn iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problemA stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problemAn exact model for a slitting problem in the steel industrySimultaneously determining the mix of space launch vehicles and the assignment of satellites to rocketsA combined approach to the solution to the general one-dimensional cutting stock problemRenovation of the cutting stock processTwo-stage two-dimensional guillotine cutting stock problems with usable leftoverThe one-dimensional cutting stock problem with usable leftover - a heuristic approachDecomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengthsEvaluation of algorithms for one-dimensional cuttingOne-dimensional cutting stock problem to minimize the number of different patternsThe one-dimensional cutting stock problem with usable leftovers -- a survey



Cites Work


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