Makespan minimization for two uniform parallel machines

We consider the two uniform parallel machine problem with the objective of minimizing makespan. The problem can be transformed into a special problem of two identical parallel machines from the viewpoint of workload instead of completion time. An optimal algorithm is developed for the transformed special problem. Although the proposed algorithm has an exponential time complexity, the results show that it can find the optimal solution for large-sized problems in a short time.