Ventura, Jose A.; Weng, Michael X. - In: Management Science 41 (1995) 9, pp. 1448-1455
In this article the problem of minimizing the completion time variance in n-job, single-machine scheduling is considered. The release times for all jobs are assumed to be zero. A new quadratic integer programming formulation is introduced. A Lagrangian relaxation (LR) procedure is developed to...