A Parallelizable Heuristic for Solving the Generic Materials and Operations Planning in a Supply Chain Network: A Case Study from the Automotive Industry

摘要

A trend in up-to date developments in multi-site operations planning models is to consider in details the different ways to produce, buy or transport products and the distributed decision-making process for operations planning. One of the most generic approaches to support global optimization in those supply chain networks by considering all the different operations alternatives and product structures is the Generic Materials & Operations Planning Problem. This problem can be modelled by a Mixed Integer Linear Programming model capable of considering production, transportation, procurement tasks and their alternatives and other relevant issues such as packaging. The aim of this paper is to introduce the implementation of a parallelizable heuristic method for materials and operations planning and its application to a case of a Supply Chain Network of the automotive industry. The approach uses variants of the GMOP model to overcome traditional MRP systems' limitations.