Problem 1: A machine shop processes orders from a variety of clients. One of the machines...

 

Transcribed Image Text:

Problem 1: A machine shop processes orders from a variety of clients. One of the machines has 6 jobs remaining to be processed. Job 1 2 3 4 5 6 Due Date 10 5 10 24 19 25 Processing Time 10 3 4 9 11 7 Furthermore, assume you have the following precedence constraints: Job 1 has to precede Job 2 and 3 Job 4 has to precede Job 3 If the objective is to minimize the maximum Lateness, how would you modify the above ILP? Problem 1: A machine shop processes orders from a variety of clients. One of the machines has 6 jobs remaining to be processed. Job 1 2 3 4 5 6 Due Date 10 5 10 24 19 25 Processing Time 10 3 4 9 11 7 Furthermore, assume you have the following precedence constraints: Job 1 has to precede Job 2 and 3 Job 4 has to precede Job 3 If the objective is to minimize the maximum Lateness, how would you modify the above ILP?

Answer rating: 100% (QA)

1 Job 1 Processing time 3 hours Promised due date 2 days from now 2 Job 2 Process... View the full answer