Q A book binder has one printing press, one binding machine and manuscripts of a number of books.

The time
required to perform the printing and binding operations on each book are shown below. The binder wishes to determine
the order in which the books should be processed, so that the total time required to process all books is minimized.
Book : 1 2 3 4 5 6
Printing Time (hrs) : 30 120 50 20 90 110
Binding Time (hrs) : 80 100 90 60 30 10

Sol. : Optimal Sequence: 4-1-3-2-5-6 ; Elapsed Time = 430 hrs. ; Idle Time for printing machine = 10 hrs. and
binding machine = 60 hrs.

Q A machine operator has to perform two operations, turning and threading on a number of different jobs. The
time required to perform these operations ( in minutes) for each job is known.
Job Time of turning (min) Time of threading (min)
1 3 8
2 12 10
3 5 9
4 2 6
5 9 3
6 11 1
Determine the order in which the jobs should be processed in order to minimize the total time required to turn out all the
jobs.

Sol. : Optimal Sequence: 4-1-3-2-5-6 ; Elapsed Time = 43 min. ; Idle Time for turning operation = 1 min. and
threading operation = 6 min.

Q. Determine the optimal sequence of jobs that minimize the total elapsed time based on the following
information. Processing time on machines is given in hours & passing is not allowed.
Job A B C D E F G
Machine M1 3 8 7 4 9 8 7
Machine M2 4 3 2 5 1 4 3
Machine M3 6 7 5 11 5 6 12

Sol. : Optimal sequence : A-D-G-F-B-C-E; Elapsed Time: 59 hrs.; Idle time is 13 hrs. for machine M1, 37 hrs. for
machine M2 and 7 hrs. for machine M3

Q A machine operator has to perform three operations, turning, threading and knurling on a number of different
jobs. The time required to perform these operations ( in minutes) for each job is known.
Job Time of turning (min) Time of threading (min) Time of knurling (min)
1 3 8 13
2 12 6 14
3 5 4 9
4 2 6 12
5 9 3 8
6 11 1 13
Determine the order in which the jobs should be processed in order to minimize the total time required to turn out all the
jobs.

Sol. : Optimal Sequence: 4-3-1-6-2-5 ; Elapsed Time = 77 min. ; Idle Time for turning operation = 35 min. and
threading operation = 49 min. and knurling operation = 8 min.
Q Find an optimal sequence for the following sequencing problem of four jobs and five machines ( when passing
is not allowed) of which processing time (in hrs) is as follows.
Job : 1 2 3 4
Machine M1 : 6 5 4 7
Machine M2 : 4 5 3 2
Machine M3 : 1 3 4 2
Machine M4 : 2 4 5 1
Machine M5 : 8 9 7 5
Also find the total elapsed time.
Sol. : Optimal Sequence: 1-3-2-4 ; Elapsed Time = 43 hrs.

Q SIx jobs are to be processed on three machines A,B,C with the order of processing jobs ACB.
Job : U V W X Y Z
Processing time on A : 12 10 9 14 7 9 hours
Processing time on B : 7 6 6 5 4 4 hours
Processing time on C : 6 5 6 4 2 4 hours
The suggested sequence is job Y-W-Z-V-U-X. Find out the total elapsed time for the sequence suggested. Do you think
that the given sequence is optimal? If it is not, then find out the optimal sequence and the minimum total elapsed time
associated with it.

Q. A firm works 60 hours a week and has a capacity of overtime work to the extent of 20 hours in a week. It has
received 7 orders to be processed on 3 machines A, B and C in order A, B, C to be delivered in a week's time from now.
The process times (in hours) are recorded in the following table
Job 1 2 3 4 5 6 7
Machine A 7 8 6 6 7 8 5
Machine B 2 2 1 3 3 2 4
Machine C 6 5 4 4 2 1 5
The manager, who in fairness insists on performing the jobs in the sequence in which they are received, is refusing to
accept an eighth order, which requires 7, 2 and 5 hours respectively on A, B and C machines, because according to him
the eighth job would require a total of 61 hours for processing, which exceeds the firm's capacity. What is your advice to
him?

Q Jobs I, II, III and IV are to be processed on each of the 5 machines V, W, X, Y and Z in the order VWXYZ when no
passing is allowed. Find out the total minimum elapsed time and idle time for each of the above five machines.
Jobs Machine
V W X Y Z
I 7 5 2 3 9
II 6 6 4 5 10
III 5 4 5 6 8
IV 8 3 3 2 6

Q There are 4 jobs each of which has to go through the machines M1, M2, M3, M4, M5 and M6 in the same order.
Processing time in hours is given below. Determine a sequence of these four jobs that minimizes the total elapsed time
T. Also find out the total elapsed time and idle time on each machine.
Machine
M1 M2 M3 M4 M5 M6
Job A 18 8 7 2 10 25
Job B 17 6 9 6 8 19
Job C 11 5 8 5 7 15
Job D 20 4 3 4 8 12