Note: “Simultaneous optimization of efficiency and performance balance measures in single‐machine scheduling problems”
本文指出Federgruen和Mosheiov提出的算法不能总是找到最小化完工时间加权均值和方差问题的全局最优调度，对单机调度优化研究者有参考价值。
n independent jobs are to be scheduled nonpreemptively on a single machine so as to minimize some performance measure. Federgruen and Mosheiov [2] show that a large class of such scheduling problems can be optimized by solving either a single instance or a finite sequence of instances of the so-called SQC problem, in which all the jobs have a fixed or controllable common due date and the sum of general quasiconvex functions of the job completion times is to be minimized. In this note we point out that this is not always true. In particular, we show that the algorithm proposed in [2] does not always find a global optimal schedule to the problem of minimizing the weighted sum of the mean and variance of job completion times. © 1996 John Wiley & Sons, Inc.