Applying an Iterated Greedy Algorithm to Production Programming on Manufacturing Environment Controlled by the PBC Ordering System

Abstract

Ordering systems are a mechanism used to program the flow of production orders into the manufacturing system. The correct usage and parametrization of such systems have a significant impact on the performance of the production. One of the well-succeed ordering systems available in the literature is the Period-batch control (PBC), that allows one to group the orders into different production periods, and program it into the planning horizon. This paper assumes a manufacturing system controlled by PBC. On this system, this paper considered two performance indicators: a primary goal is to minimize the total tardiness and the second goal is to minimize the idleness of the production system. Two approaches are implemented to solve this problem: a mixed-integer programming model and eight algorithms based on the Iterated Greedy method. Beyond finding good results when comparing to the ones found by the mathematical model approach, this paper also performs the Tardiness \\(\\times \\) Production Capacity on each algorithm.