Scheduling

Q1 Five jobs are to be scheduled in two machines in a manufacturing shop All the five jobs
undergo processing in both the machines (flow shop) Table below provides information on the
processing time in both the machines

Processing Time(Min)
Job no Machine 1 Machine 2
1 4 7
2 6 3
3 2 3
4 7 7
5 8 6

a) Identify the best sequence using Johnson’s rule

b) Develop a Gantt chart for the schedule and compute the flow times and make span for the
job for this sequence

Q2 Consider the following two machines and six jobs flow shop scheduling problem. Using
Johnson’s algorithm, obtain the sequence which will minimize the make span.

Processing Time(Min)
Job no Machine 1 Machine 2
1 5 4
2 2 3
3 13 14
4 10 1
5 8 9
6 12 11

Q3 Consider the following 3 Machines and 5 jobs flow shop problem.

Processing Time(Min)
Job Machine 1 Machine 2 Machine 3
1 8 5 4
2 10 6 9
3 6 2 8
4 7 3 6
5 11 4 5