Abstract
In this paper, an identical parallel machine problem was considered with the objective of minimizing the makespan. This problem is NP-hard in the strong sense. A mathematical formulation based on an improved arc flow model with enhanced bounds was proposed. A variable neighborhood search algorithm was proposed to obtain an upper bound. Three lower bounds from the literature were utilized in the improved arc flow model to improve the efficiency of the mathematical formulation. In addition, a graph compression technique was proposed to reduce the size of the graph. As a consequence, the improved arc flow model was compared with an arc flow model from the literature. The computational results on benchmark instances showed that the improved arc flow model outperformed the literature arc flow model at finding optimal solutions for 99.97% of the benchmark instances, with the overall percentage of the reduction in time reaching 87%.