Exam helper cheat sheet, formulas queuing theory, CPM method, pert, definitions

1. Important fowula
*P- PSC1-9)
TFeo
Prebability zoopeoblei
utilizahon tachoy
LS
-9
AVg no d ut in yttm Avg no t inqlu
Ls AWs no tut ahi ithe Ayjlam
La,: W oCut oatig tn u qutt
* Mae span EP Shc 0-P
njob
P
wighe
wnd for sauantig
Moon Flou timu EF
smle for wuiqhkd SPT
*Augadinus L * CR +ima remai nin beore duu doli
Man 0aiting timu E Rumaaniny proitinu
Mean no 3 mlc G A+B H B+C
make apa when 'Min A; mavBi
aiting in prou
E
min Ci 2 ma Bi
Ony one CondiHbn should
satiay at ltast
whu e 8tauaute ia A-B-C
Achivity Dud EST EFT LFT LsL Teta Flot Fru laad JF Slauk
TF
Eij TF--9 FF
-(4-Ei) L
L Lj-Di
Li-Dij-Ej
6
-2
aGi andLj om t
Cviti cal +ath longut path o h i ="j
hetwer
PERT SD o P - h v i
to+4tm t tp
6
te i l
I s will be givenfstkddu
IF,Slack 0
2 Ts-1 e Z and

2. Nctuwor k Analyss Crash cot Analysis
Tn novmal timm
Slope -Cn
Ta-T
Craah cost
Cn
nDYmal ost
Te CYagh tim.
duondion.
Cvitical ath
divu Cont Sum ol aul normd ot
tind
indire indirtc..tota no
we ih
| total cost dirt + indirec cost
Trans portahion
M+n-1 no. q allocatiow tor IB FS)
Mod) dij:Cij-(ui n alotonj
LineaPro
Proqraming Proble. Sim
Zj Zaij CBi
LPP
ohjestive t
6h timality tond
Min z
C-7j
o
Subject to be Onstrained|
* Now valu old elamsud
t o r n w
ewnut roud
*
My Gmant
N a Valuu bld valua-KCE
NEVE
Non-negahvity coutrainM KcE Kuy Columelemand
NEVE Nuw Entexin Voniabu altmud
X20 1 0
Simple methoc
C B 8.V
Soution
Ratio. = Sol
Ke tolum elomunt
S
Slak
Supw
-S+A (Sub Aurpau and add Atificial no).
Add atifiial> +A

3. OPERATION RESEARCH
O Ful Ke so n' Rle Cud tor numbeing t ued)
An ivitial event ohich has all Outgoing aviou
wit no
An
with no tntowng
aro
is numberad .
Dlee all tha asnooAa COming ou node
into initial everh eVunt
This wiu convet Som mon nodu
t h ved . 3
g0g ou
numbu
ww buad eve to
i Daleta a tha aiowSA hae wect
Crea inittal evuti.Aslqn net naA
moX
wich ha
all arrous
iv)Continue unti tu fiual or tomiolnoda
incoming ith no Outgoing a90ou , is
numbad.
shop
Job shop
Flouw
Sequun cing
> Assumptions ftoo shop 8equm cing
Ony One opeiation
cobied Out on a machine at a poticulasu
has to be tombletd
Each obeaton Onre Btartcd haa fo be tovmplettd
behore
A n obenation m
be completed behove u 2tcot u Ceeding
An
oboation
*Only Ona
machine
ench H ia available.
ony the hnouon Ordea
* Th jpb is rocened in
Proccxingimm aa inde
þondert otheordes o ehormig Hu proay
Tha trautortation time movivg
ona job om
ineaigible
oneob Lom
machine to machina
Tha ost o Uing ia Bamg or all job
OR Cdehinition)
modellina o deoministc and obabilitic sysms
torough
oigindta
Scieh e abpradh t optimal deuision maMig
hat
Sgsems
om tal
A plications
time tabling
* poduthion plauning,controlir and sduduling.
Site slection in industry Optinal tai4 duig
Design octvil gj &tut
Fomulatin in Bunana peliuy
Wastt manqment
to min DAt
Desiq o aircalt nd auoapau str min weght.

4. Pha o OR
Delinina the poblem
Hee We deina
This bkb 3houd ad to idantih
a. objutive tha 2tudy
b. Deuision vaiabla
Cona toaina wndun whidh we should addu thu broblam
the &Lope h e OR
b.
C
Constucdtion mathamatical model
ha Model by using vaiou matham atical & 8tatigcal
by
Sol Ye
to olsby wsing th md data
Tmplomentation.
ed in Kenda's le's MOdely
Notahos
Calblc) Cdle1#)
oisa o disi bution
a aarivas_
distibuhon ollows
Could b detomi niatit
ME,D, G L manKovian, erlonq detmi nishic, genonal)
Pollow Poisson dt
b debatusa (8ewia thime ) dàtibutton
b or it cwuld be detnminiatH
M,E,Dt man kevian, erlong, dettmi niahc guwal
C no. boalld 8e1vesaC: 1,2,3,.... o)
d Queu disipliru CFCFSLCFS, SIRO , Gunal disciplia
nit qau agth or infinit quua ath
sota or infin 8outa.
init
Finit
& CM/D/ o) :(GnD/ao|m)

5. Stebs involved in Asziqnmard problom
Check for balancod mataix
n ouA
no. colum
add dwmmy O or Columnto
basbadane te mathix.
Ste 2 Rouo manupulation
Tdentify Hhe eas setub m
n each bow
Qnd
Subtrad it from otw 8etu time.
S 3 Column Manuplation
Tdentif tha Aaast setu time in each celwmn
setuhme qthat
each celwmn
Ond
ubtraed t 0m o thua setup hme qthad
Colum or the
matnix deed rom
ste2)
*Seb' Optimalitytut fines 0 to
Drauote mv
horizontal vertical
Cov
al Hh 7ot03.
N e. o lina)=
R(vank
matrix)
i4 condi tion pauste jump t 8teb
continu Om zkb S
Hno glamenda that au
Selet ths Bmallet element kon tha olamends hat ou
Bubtrad i
8leh 5
not
covehed by un, and
8ubtad it trom Ow
on non
coveud by line, ... and
COvened
om
and
elum evt
eeat 8teb 4 again
Allocation
Seasch
r o w fom tof to bottom wntil you find
O touo uwith oxady
on
Btok Allocation om that
you fid
Ona zO
Ciye