Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6898676 | European Journal of Operational Research | 2010 | 6 Pages |
Abstract
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 this lower bound is very tight and the heuristic yields solutions very close to optimal ones since the gap between the solution given by the heuristic and the lower bound is very small.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Rabia Nessah, Chengbin Chu,