In respect, of n job scheduling problem on two machines, Johnson’s condition is known as min (aif, bik)≤min (aik, bif) (1) for all if, ik(j<k) in the processing sequence (i1, i2, …,in), where aik, bik ...In respect, of n job scheduling problem on two machines, Johnson’s condition is known as min (aif, bik)≤min (aik, bif) (1) for all if, ik(j<k) in the processing sequence (i1, i2, …,in), where aik, bik are the processing times for job Jik on the two machines respectively.展开更多
文摘In respect, of n job scheduling problem on two machines, Johnson’s condition is known as min (aif, bik)≤min (aik, bif) (1) for all if, ik(j<k) in the processing sequence (i1, i2, …,in), where aik, bik are the processing times for job Jik on the two machines respectively.