In this psper, the model of the multi - machine scheduing problem for minimizing total flow time was propssed and established.

本文研究了总的流程时间最小的多机调度问题，建立了该问题的数学模型，并用一种改进遗传算法有效解决了该问题。

youdao

This paper discusses the stochastic scheduling on a single machine to minimize total weighted completion time subject to precedence constraints of chains.

研究具有链式约束的单机随机排序问题，目标函数为加权总完工时间的数学期望。

youdao

Minimize the total weighted completion time single machine scheduling problems.

最小化加权总完工时间的单机排序问题。

youdao

Minimize the total weighted completion time single machine scheduling problems.

最小化加权总完工时间的单机排序问题。

youdao