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.
文中以工件的最大遲后為目標(biāo)函數(shù)，對工件加工順序預(yù)先給定和可任意時(shí)的最優(yōu)分批分別給出了多項(xiàng)式時(shí)間算法。
Optimal algorithms are presented respectively for single machine scheduling problems of minimizing the makespan, weighted sum of completion times, maximum lateness and maximum cost.
對單機(jī)調(diào)度問題中目標(biāo)函數(shù)為極小化最大完工時(shí)間加權(quán)完工時(shí)間和，最大延誤以及最大費(fèi)用等問題分別給出了最優(yōu)算法。
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.
研究任務(wù)無準(zhǔn)備時(shí)間最小化加權(quán)最大延誤的單機(jī)調(diào)度問題，給出逆向最小帶權(quán)延誤排序法并證明其最優(yōu)性。