CH 8: SEQUENCING MODELS AND RELATED PROBLEM

Q.6 Find the sequence that minimizes the total elapsed time required to complete the
following tasks on two machines.
Task A B C D E F G H I

Machine I 2 5 4 9 6 8 7 5 4

Machine II 6 8 7 4 3 9 3 8 11

(Optimal Sequence: A-C-I-B-H-F-D-G-E; Elapsed Time: 61Hours, Ideal Time for

Machine A=11 hours, and for Machine B=2 hours)

Q.7 We have five jobs each of which must be processed on two machines A and B in the
order AB. Processing times in hours are given in the table below:
Jobs 1 2 3 4 5

Machine A 5 1 9 3 10

Machine B 2 6 7 8 4

Determine a sequence for the five jobs that will minimize the elapsed time T?
(Optimal Sequence:2-4-3-5-1; Elapsed Time: 30 Hours, Ideal Time for Machine A=2
hours, and for Machine B=3 hours)

Q.8 We have five jobs each of which must be processed on two machines A and B in the
order AB. Processing times in hours are given in the table below:
Task 1 2 3 4 5 6

Machine A 30 120 50 20 90 110

Machine B 80 100 90 60 30 10

Determine a sequence for the five jobs that will minimize the elapsed time T?
(Optimal Sequence:4-1-3-2-5-6; Elapsed Time: 430 Hours, Ideal Time for Machine
A=10 hours, and for Machine B=60 hours)
Q.9 We have five jobs each of which must be processed on two machines X and Y in the
order XY. Processing times in hours are given in the table below:
Task A B C D E

Machine X 12 4 20 14 22

Machine Y 6 14 16 18 10

Determine a sequence for the five jobs that will minimize the elapsed time T?
(Optimal Sequence: B-D-C-E-A; Elapsed Time: 78 Hours, Ideal Time for Machine X=6
hours, and for Machine Y=14 hours)

Q.10 We have five jobs each of which must be processed on two machines A and B in the
order AB. Processing times in hours are given in the table below:
Task 1 2 3 4 5

Machine A 3 7 4 5 7

Machine B 6 2 7 3 4

Determine a sequence for the five jobs that will minimize the elapsed time T?
(Optimal Sequence:1-3-5-4-2; Elapsed Time: 28 Hours, Ideal Time for Machine A=2
hours, and for Machine B=6 hours)

Q.11 We have five jobs each of which must be processed on two machines A and B in the
order AB. Processing times in hours are given in the table below:
Task 1 2 3 4 5 6

Machine A 4 8 3 6 7 5

Machine B 6 3 7 2 8 4

Determine a sequence for the five jobs that will minimize the elapsed time T?
(Optimal Sequence:3-1-5-6-2-4; Elapsed Time: 35 Hours, Ideal Time for Machine A= 2
hours, and for Machine B=5 hours)
Q.12 We have five jobs each of which must be processed on two machines A and B in the
order AB. Processing times in hours are given in the table below:
Task 1 2 3 4 5 6

Machine A 5 9 4 7 8 6

Machine B 7 4 8 3 9 5

Determine a sequence for the five jobs that will minimize the elapsed time T?
(Optimal Sequence:3-1-5-6-2-4; Elapsed Time: 42 Hours, Ideal Time for Machine A=3
hours, and for Machine B= 6 hours)

Q.13 We have five jobs each of which must be processed on two machines A and B in the
order AB. Processing times in hours are given in the table below:
Task 1 2 3 4 5 6 7

Machine A 3 12 15 6 10 11 9

Machine B 8 10 10 6 12 1 3

Determine a sequence for the five jobs that will minimize the elapsed time T?
(Optimal Sequence:1-4-5-3-2-7-6 or 1-4-5-2-3-7-6; Elapsed Time: 67 Hours, Ideal
Time for Machine A=1 hours, and for Machine B= 17 hours)

**** BEST OF LUCK ****