Nessah, Rabia; Chu, Chengbin - In: European Journal of Operational Research 207 (2010) 3, pp. 1221-1226
We consider a single machine scheduling problem to minimize the weighted completion time variance. This problem is known to be NP-hard. We propose a heuristic and a lower bound based on job splitting and the Viswanathkumar and Srinivasan procedure. The test on more than 2000 instances shows that...