machine scheduling problems required to give a scheduling program, so as to the...

多机调度问题要求给出一种作业调度方案，使所给的n个作业在尽可能短的时间内由m台机器加工处理完成。 这个问题是NP安全问题，到目前为止还没有有效的解法。对于这一类问题，用贪心选择策略有时可以设计出较好的近似算法。-machine scheduling problems required to give a scheduling program, so as to the n operations in the shortest possible time by the m-machine processing completed. The problem is NP security issues, so far no effective solution. For this type of issue, greedy strategy can sometimes choose to design a better approximation algorithm.