For the general case, optimal algorithms are presented respectively for minimizing the sum of quadratic completion times and the number of tardy jobs.

在一般情况下，对目标函数为极小化完工时间平方和与极小化总误工数问题分别给出了最优算法。

This paper is concerned with single machine stochastic scheduling problems with random ready times, processing times and due dates to minimize the number of tardy jobs.

讨论了工件准备时间、加工时间和交货期都为随机变量的单机调度问题。

This paper is concerned with single machine stochastic scheduling problems with random ready times, processing times and due dates to minimize the number of tardy jobs.

针对机器速度和准备时间不同，探讨了带机器准备时间的两台同类机半在线排序问题，以达到优化工作效率的目的。