Close-optimal production and procurement policy for a X-network of added value using lexicographic linear goal programming

One of the main challenges of operation managers of firms is to setup feasible production and procurement plans. This is also the case of more complex structures such as supply chains. In almost all firms, specific tools like ERPs are used to support managers in their decision-making tasks. These tools manipulate huge amount of data such as the order backlog, or technical, marketing, suppliers and customers data. They work often based on the MRP principles and suggest production and procurement plans after a sequential procedure which begins by the material requirements calculation followed by the load balancing process. Very often, the load balancing is under the control of managers who try to take account of implicit constraints that cannot be modelled easily. This is a difficult and often risky task because the managers do not know what the best solution of the planning and procurement problem is. In other words, there is a lack of a kind of ‘the best feasible production and procurement target’. The main idea of this article is to suggest a complementary method for planning based on a specific mathematical programming approach.