Description: Greedy method for solving the multi-machine scheduling problem. Two machines, scheduling a number of long jobs simultaneously. Each job has two sub-operations, after a sub job before the job is completed must be the first one sub operation. Reasonable to arrange the order of operations. Makes the total shortest time.
To Search:
File list (Check if you may need any files):
多机调度2.c
Download