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.
研究任务无准备时间最小化加权最大延误的单机调度问题，给出逆向最小带权延误排序法并证明其最优性。