Article ID: | iaor19931355 |
Country: | United States |
Volume: | 40 |
Issue: | 6 |
Start Page Number: | 1148 |
End Page Number: | 1155 |
Publication Date: | Nov 1992 |
Journal: | Operations Research |
Authors: | De Prabuddha, Ghosh Jay B., Wells Charles E. |
Keywords: | programming: dynamic, programming: multiple criteria |
The authors discuss a single-machine scheduling problem where the objective is to minimize the variance of job completion times. To date, the problem has not been solved in polynomial time. The authors present a dynamic programming algorithm that is pseudopolynomial in complexity. They also propose a fully polynomial approximation scheme and derive a lower bound that is useful in its implementation. Furthermore, show that the dynamic programming solution is easy to extend to a bicriteria version of the problem in which it is desired to simultaneously minimize the mean completion time.