1 paper
Danny Hermelin, Tomohiro Koana, Dvir Shabtay
We study the classical problem of minimizing the total weighted completion time on a fixed set of m identical machines working in parallel, the Pm∣∣∑wjCj problem in the s…