Abstract: This study proposes an algorithm (CLV) to find efficient solutions for multicriteria scheduling (P) problem of total completion time with maximum late work and maximum lateness on a single machine. Based on results of computational experiments, conclusions are formulated on the efficiency of the (CLV) algorithm.