A heuristic algorithm for solving the problem of load balancing

Load balancing is one of the most important problems in the field of algorithm design. This problem is NP-hard while there exists a polynomial time approximation scheme (PTAS). In order to design an effective approximation algorithm for this problem, we introduce the concept of β-Flatness and a corresponding planarization algorithm (β_PALNM) in this work, and then propose a heuristic algorithm called LBABP to solve the load balancing problem. A better approximate solution can be obtained by LBABP in O(n(logn)²) time. The experimental results show that LBABP is not only better than the Greedy and LPT, but also has good performance in the large size problem.