Modelling industrial manufacturing problem using ILP solver : Case of production analysis

This paper presents the industrial manufacturing problem, by using the ILP (Integer Linear Programming) method, which will help us to get closer to the SAT (SATisfiability) of propositional formula that is a well-known to be a NP-Complete problem. The chosen problem for this paper is the production merchandise system that has a lot of constraints, which were studied, analyzed and modeled in ILP. Our purpose for those researches is to present this industrial problem in a SAT formula, because in these last decades, a promising approach has emerged for solving efficiently large size instances by using FPGA architectures. This paper follows so this last direction and proposes a new and original way to solve them by using Integer Linear Programming, which is close to SAT.