Variance Minimization in Single Machine Sequencing Problems

The variance of flow-time and variance of waiting-time performance measures are analyzed for the single machine sequencing problem. These measures are compared and contrasted to the performance measures of mean flow-time and mean waiting-time. In particular, while the two mean performance measures attain their minimums at the same job sequence, it is shown that the sequence that minimizes the variance of flow-time is antithetical to the sequence that minimizes the variance of waiting-time. However, the minimum values of the two variance measures are equal. Relationships are also derived for the special problems where either all the job processing-times are equal or all the job weights are equal.

• 저널Management Science · 18(9) · 518–528
• 토픽Scheduling and Optimization Algorithms · Industrial and Manufacturing Engineering
• DOI10.1287/mnsc.18.9.518
• 저자Alan G. Merten