This question is a "Scheduling&Sequencing" question.

Read the question with understanding and answer it that way! Do not write a direct answer (Disslike), write down your solutions in mathematical expressions in an explanatory and legible way (Like). Do not copy and paste the answers to similar questions or questions found in the system and upload them here!!!(Disslike+complaint) Otherwise, I will give it to DISLIKE and complaint to the site administration.

Don't write "image not clear" because the question is quite legit.

Don't write "need more information" because there is no missing information in the question. If you think that there is missing information in the question, this is your ignorance. I will give you an explanatory, mathematical and step-by-step solving experience LIKE.

Thanks.

Consider P3 | brkdwn,M; | Cmax with 8 jobs. Jobs 1 10 2 10 3 7 4 7 5 7 6 7 7 7 8 7 Pi Machines 1 and 2 are available continuously. Machine 3 is not available during the interval [0, 1]; after time 1 it is available throughout. The M; sets are defined as follows: M] = {1,3} M2 = {2,3} M3 = M4 = M5 = {1} ME=M7 = Mg = {2} Use the following rules to find a schedule. (1) LPT rule: give priority to the longest job that can be processed on the machine freed. (2) LFJ rule: give priority to the least flexible job while disregarding processing times. (3) Compute the ratio Cmax(LPT)/Cmax(LFJ). Consider P3 | brkdwn,M; | Cmax with 8 jobs. Jobs 1 10 2 10 3 7 4 7 5 7 6 7 7 7 8 7 Pi Machines 1 and 2 are available continuously. Machine 3 is not available during the interval [0, 1]; after time 1 it is available throughout. The M; sets are defined as follows: M] = {1,3} M2 = {2,3} M3 = M4 = M5 = {1} ME=M7 = Mg = {2} Use the following rules to find a schedule. (1) LPT rule: give priority to the longest job that can be processed on the machine freed. (2) LFJ rule: give priority to the least flexible job while disregarding processing times. (3) Compute the ratio Cmax(LPT)/Cmax(LFJ)