单机排序中加工时间可控时的延误工件数问题

对一台机器加工时间可控时的延误工件数问题，如何构造延误工件数和加工时间减少量之间的产工线，文献「１」给出了一些理论结果，但未给出具体算法。该文在ｗｊ恒为１的条件下，分析了文献「１」所获得结果，证明了曲线上有效值的个数，并从考虑延误工件数出发在文献「１」基础上给出了构造上述曲线的具体算法。

THE SINGLE MACHINE SCHEDULING PROBLEMWITH NUMBER OF TARDY JOBS ANDCONTROLLABLE PROCESSING TIMES

For the single machine scheduling problem with number of tardy jobs and controllable processing times, Daniels and Sarin gave some results for con- trucking the tradeoff curve between the number of tardy jobs and the total crashing times, but they had not developed such an algorithm. Under the condition of all w1 equal to one, this paper analyses some results given in their paper, proves the number of efficient values in the tradeoff curve. Basing on considering only on the number of tardy jobs and the method given by Daniela and Sarin, the peper develops also an algorithm for constracting such a tradeoff curve.