Professional Documents
Culture Documents
Capacity is defined as the ability ofthe machine to produce. The capacity ofa
is ieteimined by aggregating machine capacity. Characteristically, in pror
and operations **lg"-"nt, we can have potential capacity, immediate
or effective capacity.
7) Scope of Sub-contracting
Sub-contracting means job otr-loading to established vendors. Conventionally,
low technology jobs are sub-conrracted by companies to reap a cost advantage.
However, this decision js also raken after careful cost benefit analysis. A decision
to sub-contract also depenCs. ro a great extent, on organizational policies.
For an o:sa:::-a:i:: :::::*: ::i rhe manufacture ofa single product or homogenous
producrs. ce::::.. :::,li--::::--,.n: is relatively simple, as it can be measured in terms
of the nur-: :: .::::s ::rc::;ed per unit of time, say daily, weekly, monthly or
annuaih'. Fc: er::::-e. : --11:ei malufacturer's capacity can be understood in terms
of the number c: s:cr--:e:s :::c;ced in a month. While, for a shoe manufacturer, such
measuremenr ::r, lt :::e :: :e:ms of the number of pairs produced in a month.
But for organi:atjo:s e:-:a:ei :n the manufacture of multiple products, capacity
measuremenr in le::rs --::ei::a:le units per unit dme becomes difficult because
of the sharing of co;:-::c: :::a:uiaouring facilities. In such cases, capacity may be
defined in rerms or ai a;ia:-e -alpur hours or machine hours. For example, for a
.job-shop or intermirrenr r\=::ducrion system, capacity can be measured in terms
of labour or machine hours.
For all the above operadons, the use of wire meshes is compulsory
as it helpj
in-more accurate grading through subsequent machine runs. _Based
on the abo..:
information, estimate the requirement of wire meshes and manpower,
assuming :
labour efficiency r ate of75Vo and a plant efficiency rate of g0%.
Assume a particul:-_
wire mesh can be run for 100 hours a month, as it requires thorough
cleaiing evel..
week. The nature ofjob does not warrant multi_shift working
and one ofe.atc:
can operate two machines.
Solution
1. Compute the total hours required by multiplying standard time per
Kg. (::
hours) by the average monthly requiremeni. Sinie Srandard time per "Kg
::
given in minutes, to arrive at total working hours, it
should be divided by;i
2. Since labour efficiency is 75yo, running of wire meshes (the
equipmeni), :,.
restricred to the exrent of 75To, and thus, the above value
has io te divide:
0.75 ro arrive ar the adjusred equipment running hours.
^
3. ?y
Similarly, to arrive at capacity hours at g0% utilizition of the wire
meshe.
adjusted equipment running hours has to be divided by 0.g0.
4. Finally, rhe requirement of wire meshes (the machine), is decided
by dividir:
the adjusted capacity in hours by the available hours per machine,
which :_.
100 hours per month, as indicated above.
Actual
Efficiency - Effective output
capacity
Effective capacity is determined as:
Effective Capacity = Design Capacity (maximum output rate) _
Allowances ie.:.
personal time, maintenance, and scrap)
i :.j SeqLrencing of production
145
- -..:rensive method
- rrr ,-,f rrrining. and can be developed cven bv
' . :.-:ided rime and work
schedule for.each job.
146 production and Operations Managemenr
Disadvantages
The above chart shows that Machine-A has been loaded till u.eel 5
and Machine-B has been loaded till the first half of the 4,, week ad
With computer support, Gant Charts (Fig.5.2) can nori. bc
software. One such computer generated Gantt chart drawn using
in Fig. 5.2.
776 Production and Operations Managemei:
'-
: :-O definition provides a more meaningful basis for
:- =:.onomist, for effective accomplishment of work,
nr ' -. r.:::n (rvhich broadly includes the tasks, working
-:--: . and *'orking space), with the capabilities and
- '---; ::ocess, he tries to ensure job satisfaction for the
{ -. -:::;.s their productivity.
r ,:-: :: ::- all schemes of human activity, be it in offices,
-- :-: :'.en in space. Some ofthe areas where ergonomics
ilf-: :: 1_::
:i .i,:: and hand tools
_: t-:-:ng systems
.
"-,
""-' :::: ::sts
::-its and steps
sten for operators
- --: :l:,:,ures
r:l:i
--:-:::ometric data, personal background, education,
' ::: ser. intelligence, aptitude, reaction time, interest,
- - : :i
-
- :emperament, attitude towards work, motivation,
vethod (CPM)
ers: ::: :lanning, scheduling, estimating and controlling
::r- .--.is method was used by Da Pont in 1959 to schedule
t;::.i:'i:j during changeovers. The lessons learned through
.::- --\=tr for planning purposes, building and construction,
;1 - r- lrolects.
scheduling and controlling complex
=:-:-::e of planning,
r:j:-:---' using arrows to represent specific jobs. Such line
x.r:[::j:s of every task to every other task; this cannot be
-';.::- .-i's are those jobs which relate to one another (from
::.: depending upon the completion of the one before
:E-:.-:: :s the summation of the time to be taken up by a
r::':-::ian one crirical job in a pro.ject.
3,or ::=am illustrates the jobs to be performed to finish a
:::ing and costs. Once all these elements are specified,
*r: ::s. of the project can be determined by adding the
-:e :::sequences of various managerial decisions can be
'lf E: -::,:afi.
que
; ::sed on critical
path scheduling. However, there
:r-,i een PERT,/PEP and critical-path scheduling. The
irl-'a-.: iihere there is no established system for doing rhe
: :r.-; :or estimating the required time to complete each
urha ::- -re other hand, is usually applied to jobs which are
rn:c :t:,.:e and where it is possible to predict performance
r;r-: ;::histicated mathematical models must be used in
s-:.=-: r. follows:
::ir -: i:-:grostic an d prognostic; it is used to quantify hnowledge
:: ---.-.:..:;ing intellectual and physical activities, essential for
:,';:lines. It is a technique for focussing mqnqgement's
r!; -.;^:-: -emed.ial d.ecisions, and on at eas of et'fort which hat'e
Production and Operations Management
\:TWORK ANALYSIS
' : :.:-.:tits of network analysis, it has some inherent defects
:a LS
. ES) D (EF)
r :F) D (EF)
Production and Operations Managemenr
where,
ES stands for earliest start
LS stands for latest start
EF stands for earliest finish and
LF stands for latest finislr
G stands for early start of successor activities
D stands for early finish of existing activity
For calculation of float under the AOA method, we use the follor---:r
Independent float (lF) : EF_LS
Free Float (FF) : G (ES) -D (EF)
Total float = D (LF)- D (EF)
Formulae are:
Apart from all the floats mentioned, we have the interference float.
as the difference between total float and independent float.
Let us understand the interference float, using a simple examF.'-
XIMB Bhubaneswar has organized an international conference ar rh:--
they are expecting nearly 2000 experts from across the counrn :-lt
The conference is scheduled for 15'i' to 19'r'July, 2012. The insrii---:
for the travel of delegates by air. Bhubaneswar has a small a--':r:
flying operations. The institute has to arrange for special flights ::
July onwards, and for departure, from 20't'July onwards. Bhut.---
temples, and has a lot of sightseeing opportunities. Expectine :-':n
leave immediately after the conference, from 20th July, 2012 onlr -=
flight availability, and that some guests would opt for sightseeir::, r+
the floats as under:
Suppose a delegate decides to delay his,Aer journey for shopp:.-.-=
for a day; this one day is called independent float. Any time be,,.---,:
actual conference timing), would be considered as the total floa:
float is the scope to modify the sightseeing time, depending on ---
delegates.
Thus, for a project, consideration of floats helps us decide ri'hi:
given priority, and which has to be rescheduled. Floats, therelc::
the project with resource optimization by manipulating the :r,:-r
non-critical tasks.
-- I -! ::ralvsis and project Management
207
\ETWORKS
or. jobs
.4-"::i _(tasks or operations) that are performed in
,-- ::3 logically
:rLfl' or technologically. J"."i|.", it
.'- r .-cific acrivirjes rhar cJmprise f"iti"ffy,'
,h";;;;;'rnJ;;";,
r-, - :o \\'e can illustrate this - ^
with the loliowing
. -':. J\C machine has been procured from ;bro;J "r"_pt",
'a;;
-. i:: activity starts with the procurement of rnanpo*",ir
:-- ':.: jrm from which the machine has been or.i-rr"al
--:.- rork doing elecrrical work. insralling rh;.;;;;,
-- : ::.:-',, the trial run. The various activiii"."r"q"r."i
: -:-:-::d, time-wise as below (Table 7.1):
i't"
ll-::* .::: precedenCe
a CNC Machine
,r:i-- ::-: a
Immediate
Predecessor(s)
:;:'::-.:ndation
the various activities and events ofa project. Activities are physical r-,:
part of a project, and are represented by an arrow in a nitwork :::-
of an activity' is represented by the head of an arrow, while the t:-: s
the tail of an arrow-
In a network, an event indicates accomplishment of some task. l-:,:
ending of an activity are represented by events (initial and termi---:-
as a node. We indicate nodes by a circle, and number it using the i
In line with Fulkerson's Rule we follow the steps as undei to .-_:
which help us to correctly draw the network diagiam.
. Number the initial arrow as 1. Initial arror.v has no incominE :-:
have outgoing arrows.
. Represent each activity by a single arrow.
. Maintain precedence relationships among the activities.
. If required, include dummy activiries to maintain preceden.: ::
. Avoid looping among acriviries.
. Create nodes from the initial node (at least more than 1).
consecutively.
-j:
. Repeat the process to reach the final node, where all arros
=
, l(r, rnrlr
l6l
Process and rules of drawing the diagram Notice we have o:_i. e
end event in the diagram. Time requirement in the diagram flc..i:
.,--:-. ::i\'sis and project Management
],.CGRAM SYMBOLS
o .'- : . . _-:l in the network diagram are indicated (tnFig.7.3)
Z is a durnmy activity, it is
dotted line. It is required to a,;..1
having the same head and lail ei:*
8,,
o
.------------.. ^-/ A mu\r fini(h hefore errhrr B or C cjrn \rrn
Q- C
\
-{. --'*
^ r-
both A and B musl finish before C can sur
.rF
-9,.
\ \ B,,-'
a)--l borh A and c murr fini:h before eilher B or l
,tv\D -\
c,./
A^B
--------------t{ )----------}
Y
Dummy A must finish before B can start. boih A ai1 :
must finish before D can start
cAo
->(,/------------>
Figure 7 -4 Vorious siluolions presenled in nehvork dic-o':-
The dotted arc in the last case represents dummy activity. Dumlnr
zero completion time and represent those precedence relationshiPs
represented easily considering the actual activities of a projecr.
(N (N$,rs-iq\'\s (qttqd atcs \t.' Ret Nctk dite.tattrs-
Network Analysis and project
Management
271
- : PROGRAMME EVALUATION
AND REVIEW
TECHNTQUE (PERT)
- - : . e so far discussed
,,
the methodology of scheduling rimes
:--: : :ath and the project of different activities,
t"ngtn, ;,*,,r;,:r::,;"
.-.r '.. activity times are ".*iii,i-g known ard constanr.
known and.consr.,-', B;l *i,
u : ::: PERT, as there is every possibility J:"_pd;r,rg "rlr-p,,." does not hold
:- - :- :iere may be some unplanned a"f"y. job before the expected
*". "
rf.,rr, i,irr".i"oil.uing,
-.i! be rhree estimares for an acrivitv single esrimare,
(b-a\
6
Let us now calculate the earliest time, both for events 4 and 5.
;:!: ;:art time for event 2 is day 3 (by this time, the minimum amount
of
- -- -:: is Ieft to complete subsequent tasks).
producti.on and Operalions Management
zl4
Start Time for Event 1:
Solution to Calculation of Latest
one - the latest start time
for even:
This solution builds on the previous
3 therefore:
. Identify the longest duration along each path. The longest duration is obr:
the critical path in the network.
Let us now try this problem. In the table below, we have given optimistic (a
likely (m) and pessimistic (p) time for the completion of a project. Comp::=
expected time of project completion and draw the network to show the critic-
(please do the drawing part yourseli)
Tie - a+4m+
bl6
After you draw the network, check whether you are getting the criricz-
7-2-3-5 7 8 or A-B-E G-I. Summing up the time, along the critical
expected time for project completion or project length would be 37 dal's-