Consider the following 3-job 3-machine job shop scheduling problem in which all jobs are available at...

Transcribed Image Text:

Consider the following 3-job 3-machine job shop scheduling problem in which all jobs are available at time zero, and makespan is the measure of performance to be minimized. Processing Time Operation Route Operation Job 3 2 3 1 M1 M2 M3 4 2 3 2 3 MI M2 2 4 M3 М2 MI 3 5 3 (a) Suppose that the dispatching rules for Machines 1, 2 and 3 are SNOo, FCFS and MWRK, respectively. Apply these dispatching rules to determine a feasible schedule, and illustrate it on a Gantt chart. In case of tie-breaks, select the job having the smallest job index. (b) Using the two-phase heuristic, construct a feasible schedule, and illustrate it on a Gantt chart. (c) Suppose that have the following technological restrictions while processing the jobs. • Job 3 should be processed before Job 2 on M1, Job 2 should be processed as the first job on M2, Job 1 should be processed before Job 3 on M3, and Considering these restrictions, draw a network diagram. Consider the following 3-job 3-machine job shop scheduling problem in which all jobs are available at time zero, and makespan is the measure of performance to be minimized. Processing Time Operation Route Operation Job 3 2 3 1 M1 M2 M3 4 2 3 2 3 MI M2 2 4 M3 М2 MI 3 5 3 (a) Suppose that the dispatching rules for Machines 1, 2 and 3 are SNOo, FCFS and MWRK, respectively. Apply these dispatching rules to determine a feasible schedule, and illustrate it on a Gantt chart. In case of tie-breaks, select the job having the smallest job index. (b) Using the two-phase heuristic, construct a feasible schedule, and illustrate it on a Gantt chart. (c) Suppose that have the following technological restrictions while processing the jobs. • Job 3 should be processed before Job 2 on M1, Job 2 should be processed as the first job on M2, Job 1 should be processed before Job 3 on M3, and Considering these restrictions, draw a network diagram.