PRODUCTION OPERATION MANAGEME
194
of
Operationsin a Production Process
Sequencing problem):
8.3. (Assignment
Sequence is an order in which a number of a jobs (operations) can
facilities
number of service (machines/
be an
donecffectivefinite
production etc For the determination
processing time, cost ofknow all the operations and the order inof
equipment)
on a manner. The measure of f effectiveness can be in terms of
sequence one should
proper
One be
these can executed
of thc commonto get the desired product.
problems in production process is allocation of
which
utilise
operations (jobs) on machines, so as to the machines in
various
an optimum manner.
To explain the procedure of sequencing, here we shalI consider
cases, namely:
In thedifferent
only three system there are only two machines M,and M, and there
are n jobs, each job is to be carried out on M, and then on M,ie. the
order of the machines is M,, M,.n jobs are to be processed on th
machines in the order M1, M2, M3.
(ii) n jobs are to be assigned to m machines.
8.3.1 Two machines and n jobs
Knowing the processing time required by each job on the machinrs
Johnson gave the following rules for assignment:
(i) Find the job with smallest time of processing. If this time
corresponds to machine M, then assign the job as Ist job on M1 andif
this corresponds to machine M2, then assign the job as the last job on
machine M2.
(ü) Remove the jobs already assigned from the candidate list and
repeat step (i) to remaining jobs. Continue the process till all jobs are
exhausted.
(ii) If there are more than two jobs
having same smallest time
corresponding to the same machine, then the order of assignment for
these jobs is arbitrary.
The method is illustrated by
Exanples 1. Six jobs are to following examples
be processed
:
on two machines. The
processing time for each job on
sequence of jobs that minimises cach
total
machine given below. Find the
Also calculate the minimum elapsed elapsed time to complete the jobs.
first on machine M,. time. The jobs are to be
proCeSSM
Jobs
Machine
M1
B C D E
M2 6 3 6 7 5
3
of theSolution. is thc case of two
7
It 2 8 4
machines is M, M,. If we scemachines
the
with six jobs and the order
times, then the
proccssing
PERT
guTING SCHEDULING CPM AND 195
minimum time is 2for job Don machine M.,. Hence by rule 1, we assign
M,.
Das last job on machine
Sequence of Jobs
D
mhe next smallest time is 3 which is for job C on M, and Job B on
Hence job C should be assigned first place in the sequence and job B
the last but one place (last place already been assigned). At this stage of
assignment, the following will be the position of jobs in the sequence.
C B D
Next minimum processing time is 4 for job Aon M, and jobF on M.
Hence these are assigned respectively at places 2 and 4 in the sequence
ie. the sequence assignment position at this stage is
C F B D
Now there is only one empty place in the sequence and one job E is
leê to be assigned. So job E is assigned to third place in the sequence.
This completes the sequencing plan to give the order of processing as
C E F B D
A
C’A-’E’F’B’ D
Calculation of minimum elapsed time can be done in tubular form
(8.1).
Table 8.1.
Machine M, Machine M,
Order of Job
Tme Processing Time Idle
sequenced Time Processing| Time
in time out time out Time
3 10 3
0 3
10 6 16
A 3 4
14 16 24
E 7 7
19 24 4 28
F 14 5
8 27 28 3 31
B 19
33 2 35 2
D 27 6 33
all the jobs by the
Thus the minimum processed time to complete
also observed that total idle
proposed sequence is 35 time units. It is
repeated then machine
time for machine M, is 5 time units. If the cycle isprocessing of last job of
M1 will remain idle for 2 time units. Because
previous cycle is completed i.e. after 35 time units.
Example 2. A bookbinder has one printing press, one binding
The times required
machine and the manuscript of five different books.
operations for each book are known,
to perform the printing and binding which books would be processed in
we wish to determine the order in
PRODUCTION OPERATION MANAGEME
required to turn out all the
196
minimise total
time
order to minimum total elapsed
time.
IV
books. Als
find the
5 7
Book 7
3 7 3
Printing M, 2 4
Solution.
Binding M, Evidently
6 the order of processing will be M,, M, Here
minimum-processing time is 2for Book II on M2. Hence Book Il is to be
next lowest time 3 corresponds to book I on MI
processed last. AgainHence Book I is sequenced at Ist place and Book IV
M2. Book V on M2.
and Book IV on lowest time is 4 for
next Thus Book Vis
at 4th place.
The sequence of books is then
sequenced at place 3. The required IV ’ II
89
minimum elapsed time is calculated from table
The Table 8.2
Printing
Time ime in Bind1ng Time
Timc in
Sequence
Of job
processing out Process1ng
Time
Our
Tine
3 9
7
3
7 7 14 20
V
4 |9 20 23
9 20 26
Thus the minimum clapsed time is 28 time units.
8.3.2. n jobs and three machines
Let there be three machines M,, M,and M, and the order of
processing on these machine is M, -> M, -> M,i.e. it is M, M, M, system.
The sequence of jobs in this system can be done if at least one of the
following conditions is satisfied.
(i) Smallest processing time of any job on machine M, is greater
than or equal to Maximum process time of any job on machine M, ie.
processing times of all jobs on M, are more than the corresponding
processing time of jobs on M,:
(ü) Similarly smallest processing time of any job on M,
greater or equal to the maximum process time of any job on should be
M,. If at
least one of these conditions is
the processing times each job for satisfied, then for sequencing we auu
machines M, and M,. i.e Processingmachines M, and M, and also tor
Processing time of l on M,+ ProcessingTime for Job 1 on M, and ,
time of 1 on M, and Processins
Time for Job 1on M, and M, =
time of 1 on M,. Processing time of lon M, + Processi6
Now these two times for n jobs can be
using the method of 8.3.1 i.e. n used to sequence the jous v
to changed into n jobs jobs three machines
twomachines problem by
Example three illustrates the useproblem.
of this
method.
SCHHEDULLING CPM AND PERT 197
AOUTING
Beample 3. Find the sequence that mininises the total elapscd
(in hours) requirede to complete the following jobs on thrce
machines M,, M, M, in the order M, ’ M, M,
Job
Machine B
5 7 6 5
M, 1 3
2 4 5
M,
3 7 5 6 7
M,
Solution. Verification of the conditions:
Min time on Machine M,= 5 hours.
Max. time on Machine M, = 5 hours.
Min. time on Machine M, = 3hours,
Hence,
Min.time on M, > Max. Time on M.
Min time on M, s Max. Time on M,
So one of the conditions is satisfied.
The processing times of various jobs are now added first for M, and
M. and then for M, and M, to get the following table:
Jobs
Machine A C D E
M, and M, 7 8 10 14 8
M, and M, 5 9 8 11 10
Now the sequencing of the jobs can be done by the method describe
in 8.3.1 considering M, and M, as one machine and M, and M, as another
machine. Here minimum time is 5 for job A on M, M,. Hence job A is
processed last.
Similarly Job B has next minimum time on both M, M, and M, M,
and also job E on M1 M, also has the same minimum time. So we assign
job E at Ist place and job at 2nd place. The job with next lowest time is C
on M, M.. So it is assigned at place IV. The remaining Job D is assigned
3d place to get the sequence as:
B D C o
Timeu t :
E
The minimum elapsed time can be calculated from table 8.3.
time in
Time Machine M. Process
time Time
Idle
Machinetine
rocess
M, inMachine M.out
Times ldle
Thme
1
in
Times out
Time ldle
Time Time
>O
Jobs scsProcess
5 8 7 15
38
22
B 12-113 15
12 21 21 26 8 26 32
9
21 27 27 31 37
32 34 37 40
27 5 32
Minimum Elapsed Time is 40 hours.
PRODUCTION OPERATION 1AANAGE1
198 machines
job on each machine be
jobs and m times of each
8.3.3. n
Let the
following
processing
tabularform.
gven in
2 3
1 M,, .
Machine Mg
M,,
M,,
2 M
3
4
m
M m
mn2 Ma
the processing time of jh job on Machine i.
is i = 1, 2,.., mandj =1, 2, ..., n. The order
ie. M, Here processing be
on machines1, 2, 3, ...., m.
Now solution of the problem is possible if following conditione
satisfied.
At least one of min. of M, (for allj), min of M,, (for all i it
greater than or equal to max. of Ma, M,. My,... Max of M,, for all j.
(ii) If sum of processing times (M2 t Mig t Mim-) is constant for
all machines. Then sequencing of jobs can be done by considering the
processing times of machines 1 and m only.
The method is illustrated by the following example:
Example 4. Solve the following sequencing problen:
Jobs
Machine A B C D E
MI 10 12 8 15 16
M2 3 2 4 1
M3 5 6 4 7 3
M4 14 12 8 10
Order of processing being M, M, M,
Solution. We find that M,
Minimum processing time on M, is 8.
Minimum processing time on M, is 7.
Maximum processing time on M, is 5.
Hence,Maximum processing time on M, is 7.
Min. M, > Max
Min. M, 2 Max M,, Max. M,
M, Max. M
SCHEDULING CPM AND PERT 199
AOUTING
condition(i) is satisfied. The problem is reduced to two machine
So by adding the processing times M1j +M2j +M3j and
problem
M4j+MZj+M3;for each job and solving the problem by the method
describedin8.3.1.
Jobs
Combination of Machine A D
18 20 16 23 24
M+ M2 + M3 22
M4 15 20 16 18
M2 + M3 +
Mhe required Optimum sequence by the method of 8.3.1 will be
A E ’ D -> B
Alternative method :
of machines M, and M, for cach job,
1f we add the processing timessame
all jobs is i.c.8.
oa fnd that the sum for
Machincs A C D
3 2 4
M, 7
M,
8 8 8
Sum
So for this problem sequencing can be done by considering M, and
M. only i.e. consider it as
2-machine problem i.e.:
A C
M, 8 15
M.
Using method of 8.3.1, the optimal sequence again is
D ’ B
C -> A ’
83.4. Assignment of n candidates on n jobs each is be assigned
Let there be n candidates or workers and
varies with the job he is
some job. The performance of the person performance for ih candidate on
assigned. Let eij denote the measure of
Pjob. Evidently i =1,2,..... n for candidates and j=l to n for jobs.
steps:
The assignment algorithm consists of following
N
1
n
2
3
4
E=Candidate
