(i) Give the steps for sequencing n jobs through 2 machines for minimum elapsed time. 5
(ii) A foreman wants to process four different jobs on three machines A,B and C in his shop. The order of machining for all the jobs is fixed, i.e., A,B and C. The processing time for all the jobs are given in the table below:
|
Job
|
Machine
|
|
|
A
|
B
|
C
|
|
1
2
3
4
|
40
50
30
25
|
10
15
8
20
|
10
5
15
10
|
Describe the optimal sequence for the jobs to minimize the elapsed time between start of the first job to completion of the last job.