Consider the following job shop scheduling problem involving four jobs and three operations.

Solve it using Active Schedule Generation Heuristic Procedure with the Most Work Remaining

(MWKR) as the primary measure and SPT as the tie breaker. In case of tie on SPT, break the tie randomly.

Processing Times (hrs)

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

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

AppendixLO1