Filling Process Optimization through Modifications in Machine Settings

Abstract

In this paper, a mathematical model is developed for the modified settings of an automatic filling machine to minimize the filling time of orders for different volumes of dairy product and flavors. The linear programming model is solved using the Simplex method to find an optimal solution to the optimization problem. The results of the model are used for sequencing the processing of orders using one-dimensional rules with the aim of obtaining an optimal sequence for the most valued performance measure. The comparative analysis of the one-dimensional rules showed that Shortest Processing Time (SPT) is better than the other rules for minimization of the average time past due. Additionally, the results of the model for the new machine settings, when compared with previous similar studies, yielded encouraging results.