Abstract
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.
Similar content being viewed by others
References
Applegate D, Cook W (1991) A computational study of the job-shop scheduling problem. ORSA J Comput 3:149–156
Benoist T (2007) Towards optimal formwork pairing on construction sites. RAIRO Oper Res (To appear)
Gendreau M (2003) An introduction to tabu search. In: Glover F, Kochenberger GA (eds) Handbook of metaheuristics. Kluwer Academic Publishers, Boston, pp 37–54
Karp RM (1972) Reducibility among combinatorial problems. Complexity of Computer Comput, pp 85–103
Laburthe F (2000) Choco: implementing a cp kernel. In: Proceedings of TRICS, a post-conference workshop of CP 2000, Singapore, 2000
LePape C, Baptiste P (1999) Unpublished work
Shaw P (1998) Using constraint programming and local search methods to solve vehicle routing problems. Technical report, ILOG S.A., Gentilly, France
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Benoist, T., Jeanjean, A. & Molin, P. Minimum Formwork Stock problem on residential buildings construction sites. 4OR-Q J Oper Res 7, 275–288 (2009). https://doi.org/10.1007/s10288-008-0092-6
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10288-008-0092-6