Upper bounds for the total rainbow connection of graphs

A two-agent scheduling problem on parallel machines is considered. Our objective is to minimize the makespan for agent A, subject to an upper bound on the makespan for agent B. When the number of machines, denoted by (m), is chosen arbitrarily, we provide an (O(n)) algorithm with performance ratio (2-frac{1}{m}), i.e., the makespan for agent A given by the algorithm is no more than (2-frac{1}{m}) times the optimal value, while the makespan for agent B is no more than (2-frac{1}{m}) times the threshold value. This ratio is proved to be tight. Moreover, when (m=2), we present an (O(nlogn)) algorithm with performance ratio (frac{1+sqrt{17}}{4}approx 1.28) which is smaller than (frac{3}{2}). The ratio is weakly tight.