最小化加权总完工时间的单机排序问题。
Minimize the total weighted completion time single machine scheduling problems.
研究了可中断的带有到达时间的使总完工时间最小的恒速机排序问题。
A preemptive uniform machine scheduling problem with arrival time and minimum makespan is studied in this paper.
研究具有链式约束的单机随机排序问题，目标函数为加权总完工时间的数学期望。
This paper discusses the stochastic scheduling on a single machine to minimize total weighted completion time subject to precedence constraints of chains.
提出并研究两台机器环境下的以带权总完工时间为目标函数的越库配送排序问题。
This paper considers the cross docking distribution scheduling problem, with the objective to minimize the total weighted completion times.
以总完工时间为目标的无等待流水车间调度问题是一个重要的制造加工系统，广泛应用于工业生产中。
No-wait flow shop scheduling problems with total flow time minimization is an important manufacturing system widely existing in industrial environments.
讨论了工件加工时间随开工时间线性增加的成组排序问题，考虑的目标函数是总完工时间，在成组技术的限制下，总完工时间问题是多项式时间可解的。
In these two problems, the job processing time is a linear decreasing function of its starting time, the objective is to minimize the total completion time.
在一般情况下，对目标函数为极小化完工时间平方和与极小化总误工数问题分别给出了最优算法。
For the general case, optimal algorithms are presented respectively for minimizing the sum of quadratic completion times and the number of tardy jobs.
在一般情况下，对目标函数为极小化完工时间平方和与极小化总误工数问题分别给出了最优算法。
For the general case, optimal algorithms are presented respectively for minimizing the sum of quadratic completion times and the number of tardy jobs.
应用推荐