Workload balancing in identical parallel machine scheduling using a mathematical programming method
Abstract
This paper addresses the workload balancing problem in identical parallel machines context. The problem consists of assigning different jobs to identical parallel machines in order to minimize the workload imbalance among the different machines. This problem is formulated as a linear mixed integer program to minimize the difference between the greatest and smallest workload assigned to each machine. Based on some numerical examples reported in the literature, we establish that the classical formulation which consists of minimizing the greatest machine completion time does not provide the optimal workload repartition. That is why we consider a new mathematical formulation based on the minimization of the difference between the workload of the bottleneck machine and the workload of the fastest machine. The proposed programming method is also used to provide optimal solutions in reasonable computational times for different test problems presented in the literature by Raghavendra and Murthy to test their genetic algorithm.