main--(1).zip_Write On

clc clear all close all jobs= [ 1 2 3 4 5 ]; % jobs M = [5 4; 3 3; 1 9; 8 4; 3 6]; % time process in M1 and M2 [val ind] = sort(min(M')); % find the minimum of each rom (the minimum time... %a job can be done using machine 1 and 2) then sort the result in order to %find the janson's order .... %display the result ... disp('The order Jobs are executed based on Janson theory :') jobs_order = ind' %Job's order % Showing the ending time of each process in machine 1 disp('Starting time of each proccess in Machine1'); % cumsum(M(jobs_order,1))-(M(jobs_order,1)) disp('Ending time of each process in Machine1'); end1 = cumsum(M(jobs_order,1)) start_time_M2(1)=end1(1); for i=1:size(jobs,2) end_time_M2(i)= start_time_M2(i)+(M(jobs_order(i),2)); if i<size(jobs,2) start_time_M2(i+1) = end_time_M2(i); end end disp('Starting time of each proccess in Machine2'); start_time_M2 disp('Ending time of each process in Machine2'); end_time_M2