4OR

, 7:275 | Cite as

Minimum Formwork Stock problem on residential buildings construction sites

Industry

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.

Keywords

Dantzig–Wofle decomposition Local search 

MSC classification (2000)

90B99 

References

  1. Applegate D, Cook W (1991) A computational study of the job-shop scheduling problem. ORSA J Comput 3:149–156Google Scholar
  2. Benoist T (2007) Towards optimal formwork pairing on construction sites. RAIRO Oper Res (To appear)Google Scholar
  3. Gendreau M (2003) An introduction to tabu search. In: Glover F, Kochenberger GA (eds) Handbook of metaheuristics. Kluwer Academic Publishers, Boston, pp 37–54Google Scholar
  4. Karp RM (1972) Reducibility among combinatorial problems. Complexity of Computer Comput, pp 85–103Google Scholar
  5. Laburthe F (2000) Choco: implementing a cp kernel. In: Proceedings of TRICS, a post-conference workshop of CP 2000, Singapore, 2000Google Scholar
  6. LePape C, Baptiste P (1999) Unpublished workGoogle Scholar
  7. Shaw P (1998) Using constraint programming and local search methods to solve vehicle routing problems. Technical report, ILOG S.A., Gentilly, FranceGoogle Scholar

Copyright information

© Springer-Verlag 2008

Authors and Affiliations

  • Thierry Benoist
    • 1
  • Antoine Jeanjean
    • 1
  • Pascal Molin
    • 2
  1. 1.e-lab-Bouygues SAParisFrance
  2. 2.École normale supérieureParis Cedex 05France

Personalised recommendations