Consider the following job shop problem. Find the scheduling using Nondelay generation heuristic with the following priority rules.

First Level Priority Rule : MWKR (most work remaining)

Second Level Priority Rule : SPT (shortest processing time)

Third Level Priority Rule : Random order Processing Times (hrs)

Operations 1 2 3 Job 1 1 2 3 Job 2 5 3 2 Job 3 3 2 4 Job 4 4 3 5 Routing Operations 1 2 3 Job 1 1 2 3 Job 2 2 3 1 Job 3 3 2 1 Job 4 2 1 3.

AppendixLO1