Nessah, Rabia; Chu, Chengbin - IÉSEG School of Management, Université Catholique de Lille - 2008
We consider a single machine scheduling problem to minimize the weighted completion time variance. This problem is known to be NP-hard in the strong sense. We propose a lower bound based on splitting of jobs and the Viswanathkumar and Srinivasan procedure and a heuristic. The test on more than...