Article ID: | iaor200971758 |
Country: | Germany |
Volume: | 7 |
Issue: | 3 |
Start Page Number: | 275 |
End Page Number: | 288 |
Publication Date: | Oct 2009 |
Journal: | 4OR |
Authors: | Benoist Thierry, Jeanjean Antoine, Molin Pascal |
Keywords: | programming: constraints |
The Minimum Formwork Stock problem (MFS) consists in minimizing the quantity of shuttering materials needed for a construction site. This paper introduces this problem encountered in a French building company and presents two different solving approaches: a constraint programming model combined with a constructive heuristic and a Dantzig–Wolfe decomposition taking advantage of the size of real world instances. Then, a NP-hardness proof of the problem is established before providing results on real instances.