Question: 3.20. Consider the problem 1 1| Lmax- The Minimum Slack first (MS) rule selects at time t, when a machine is freed, among the remaining

3.20. Consider the problem 1 1| Lmax- The Minimum Slack first (MS) rule selects at time t, when a machine is freed, among the remaining jobs the job with the minimum slack max(dj -pj - t,0). Show through a counterexample that this rule is not necessarily optimal. 3.20. Consider the problem 1 1| Lmax- The Minimum Slack first (MS) rule selects at time t, when a machine is freed, among the remaining jobs the job with the minimum slack max(dj -pj - t,0). Show through a counterexample that this rule is not necessarily optimal
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
