1 paper
G. Calinescu, F. Jaehn, M. Li +1
In this paper we study the classical scheduling problem of minimizing the total weighted completion time on a single machine with the constraint that one specific job must be sched…