A note on efficient sequences with respect to total flow time and number of tardy jobs
针对同时最小化总流程时间和延迟作业数量的单机调度问题，本文基于两两交换的简单思想，给出了一个比现有证明更简洁的有效序列下界证明。
Abstract For the single‐machine scheduling problem with the objective of simultaneously minimizing total flow time and number of tardy jobs, a lower bound on the number of efficient sequences is known. However, the proof thereof, which makes use of a modified version of Smith's algorithm, is unduly lengthy and sophisticated. Adopting a totally new point of view, we present in this short article a much simpler proof based on the naive idea of pairwise interchange. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 346–348, 2016