用贪心法求解多机调度问题。两个机器，调度多项不同时长的作业。每个作业有两个子作业，后一项子作业必须在前一项子作业完成之后才能操作。合理安排这些作业的顺序。使得总时间最短。-Greedy method for solving the multi-machine scheduling problem. Two machines, scheduling a number of long jobs simultaneously. Each job has two sub-operations, afte