A hybrid heuristic to solve the two dimensional cutting stock problem with consideration of forecasts

Ayadi, Omar; Cheikhrouhou, Naoufel; Mellouli, Ahmed; Masmoudi, Faouzi

doi:10.1109/iccie.2009.5223834

Cited by 2 publications

(2 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The design of patterns corresponding to particles follows a procedure inspired and adapted from the concept of "available rectangles" [2,7]. This procedure is based on dividing the pattern into different shelves and to affect pieces in available rectangles belonging to the shelf situated as bottom as possible.…”

Section: Description Of the Algorithmmentioning

confidence: 99%

“…In addition, long residual plates can be affected by plastic deformation caused by bending if they are stocked for long periods in inappropriate storages. A suitable solution is proposed in [2,7] for this problem, consisting of combining the make-to-order and the make-to-stock demand management policies in the CSP. This solution considers a multi-period planning with a rolling horizon, in which pieces to be cut in each period should fulfill firm orders and optimize the use of raw material by integrating forecast plans.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An adapted particle swarm optimization approach for a 2D guillotine cutting stock problem

Ayadi

Barkallah

2016

Mechanics & Industry

Self Cite

View full text Add to dashboard Cite

This paper focuses on the two dimensional rectangular non-oriented guillotine cutting stock problem in which pieces with different dimensions need to be cut with different quantities in order to satisfy customers orders. In order to optimize the raw material utilization, make-to-order and make-to-stock production strategies are combined by considering forecast plans with inventory constraints in addition to firm orders. An adapted version of Particle Swarm Optimization approach is proposed and combined to a hybrid heuristic. Results show that the proposed algorithm outperforms the hybrid heuristic in a reasonable computational time.

show abstract

Section: Description Of the Algorithmmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%