Аннотация:In this paper, we consider the following scheduling problem. On the single machine need to process $n$ jobs. Job $j, j=1,\dots, n,$ characterized: release times $r_j = j - 1$; processing time $p_j = 2$; weight of jobs are non-decreasing $w_j \leq w_{j+1}$.\\ The objective function is $\min{\sum\limits_{j=1}^n (w_j \cdot C_j)}$, where $C_i$ -- completion time.