Minimizing Variation of Flow Time in Single Machine Systems
研究单机环境下n个作业的调度问题，目标是最小化流程时间的变异。对于总绝对差度量，给出了简单解法；对于方差度量，提出了启发式方法，效果优于文献中的其他方法。
This paper addresses the problem of n jobs to be scheduled on a single machine in such a way that flow time variation is minimized. When the measure of variation is total absolute difference of completion times (TADC) the problem is shown to be quite simple. Sufficient conditions are shown for minimal TADC and a simple method for generating an optimal solution is provided. When the measure of variation is variance of flow time the problem is much more difficult. For this case a heuristic method for scheduling is proposed. The heuristic is simple and provides solutions which compare favorably with others found in the literature.