maximum lateness

基本解释

Taking the maximum lateness as objective function, this paper develops a polynomial time algorithms for the processing sequence of then jobs given or not given.
文中以工件的最大遲後爲目標函數，對工件加工順序預先給定和可任意時的最優分批分別給出了多項式時間算法。
Optimal algorithms are presented respectively for single machine scheduling problems of minimizing the makespan, weighted sum of completion times, maximum lateness and maximum cost.
對單機調度問題中目標函數爲極小化最大完工時間加權完工時間和，最大延誤以及最大費用等問題分別給出了最優算法。
In this paper, reversed order algorithm according to the minimum of job with weighted lateness and difference function algorithm are given to minimize the maximum of job with weighted lateness.
研究任務無準備時間最小化加權最大延誤的單機調度問題，給出逆曏最小帶權延誤排序法竝証明其最優性。