Description: 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.
File list (Check if you may need any files):
Download