机器调度是指有m台机器要处理n个作业，设作业i的处理时间为ti，则对n个作业进行机器分配，使得：

(1)一台机器在同一时间内只能处理一个作业；

(2)一个作业不能同时在两台机器上处理；

(3)作业i一旦运行，则需要ti个连续时间单位。

设计算法进行合理调度，使得在m台机器上处理n个作业所需要的处理时间最短。

-Machine scheduling is the m-machine has to deal with n-operations, set up the processing time for operation i for ti, while operations on the n-machine allocation, makes: (1) a machine at the same time one can only deal with operations　(2) an operation at the same time should not deal with the two machines　(3) operating i once run, you need ti consecutive time units. Rational design of scheduling algorithm, making the m machine n-deal operation required the shortest processing time.