VASAVI COLLEGE OF ENGINEERING :: HYDERABAD-31

DEPARTMENT OF MECHANICAL ENGINEERING

COURSE PLAN
B.E. 4/4 (Mech. A) Aca. Yea!: "#14-1$ - I Se%
S&'(ec) Na%e: O*e!a)+,-. Re.ea!ch Faculty: P.V.S.Subhashini
S.
No.
UNIT Brief details of Unit
No. of
periods
required
Remarks
1
I
Introduction to operations research, history, definition, applications.
Construction of linear programming model, standard LP,
determination of basic solutions, unrestricted ariables and
solutions.
Simple! method, "ig#$ method, t%o#phase method, degeneracy,
unbounded infeasible solution.
1&
& II
'efinition to duality, relationship bet%een primal and dual solutions,
(conomic interpretation.
'ual simple! method
Sensitiity or post optimal analysis
Integer programming.
1)
* III
Transportation model: Finding an initial feasible solution+ north
%est corner method, least cost method, Vogel,s appro!imation
method, finding the optimal solution, optimal solution by stepping
stone and $-'I methods, special cases in transportation problems
+ .nbalanced transportation problem.
Assignment Problem: /ungarian method of assignment problem,
ma!imi0ation in assignment problem, unbalanced problem,
problems %ith restrictions, traelling salesman problems
11
1 IV
Replacement models: Introduction, replacement of items that
deteriorate ignoring change in money alue, replacement of items
that deteriorate considering change in money alue %ith time,
replacement of items that fail suddenly + indiidual replacement
policy, group replacement policy.
Game theory: Introduction, & person 0ero sum games, ma!imi+
minima principle, principle of dominance, solution for mi!ed strategy
problems graphical method for & ! n and m ! & games
11
2 V
Sequencing models: introduction, general assumptions,
processing to 3obs through & machines, processing 4n, 3obs through
m machines processing & 3obs through m machines.
Queuing theory: introduction, single channel + passion arrials +
e!ponential serice times %ith infinite population and finite
population, multi channel+poison arrials + e!ponential serice
times %ith infinite population.
Introduction to optimization Techniques: Single ob3ectie and
$ulti ob3ectie optimi0ation techni5ues li6e 78,9S78,P-: and
$PS- techni5ues
11
Total periods:
Note: The number of periods to be planned for 55-60 for semester course
Signature of the faculty Signature of the !" Signature of the PRI#$IPA%
$/
VASAVI COLLEGE OF ENGINEERING :: HYDERABAD-31
DEPARTMENT OF MECHANICAL ENGINEERING
LESSON PLAN
Acad. Year: 2014-15 - I Semester B.E. 4/4 Mech. A
Subject Name: Operations Research Name of the staff member: P.V. S Subhashini
S. 9o. .nit 'ate ;opic coered 9o. of
periods
Cumulatie
periods
1 I &1.)<.1*
Introduction to -perations research
1 1
& &&.)<.1*
-perations research, /istory, 'efinition
1
&
* &1.)<.1*
8pplications of operations research
1
*
1 &2.)<.1*
Construction of linear programming model, standard form
of LPP# determination of basic solutions
1
1
2 &=.)<.1*
.nrestricted ariables and solutions.
1
2
> *1.)<.1*
Problems## .nrestricted ariables and solutions
1
>
< )1.)=.11
Simple! $ethod
1
<
= )1.)=.11
;%o Phase $ethod
1
=
? )2.)=.11
Problems## ;%o Phase $ethod
1
?
1) )<.)=.11
'egeneracy, .nbounded solutions
1
1)
11 )=.)=.11
Infeasible solutions
1
11
1& 11.)=.11
Problems## Infeasible solutions
1
1&
1* II 1&.)=.11
@elations bet%een optimal primal A'ual solution
1
1*
11 11.)=.11
(conomic Interpretation# Problems
1
11
12 1=.)=.11
'ual Simple! $ethod
1
12
1> 1?.)=.11
Problems## 'ual Simple! $ethod
1
1>
1< &1.)=.11
Problems## 'ual Simple! $ethod
1
1<
1= &&.)=.11
Post optimal or sensitiity analysis
1
1=
1? &2.)=.11
Problems on sensitiity analysis
1
1?
&) &>.)=.11
Problems on sensitiity analysis
1
&)
&1 &=.)=.11
Integer Programming
1
&1
&& )1.)?.11
Problems## Integer Programming
1
&&
&*
I I I
)&.)?.11
Introduction to transportation and formation , 9.B, LC,
Vogels method
1
&*
&1 )1.)?.11
$-'I method
1
&1
&2 )2.)?.11
'egeneracy and unbalanced ;ransportation model
1
&2
&> )=.)?.11
I#Internal ;est
1
&>
&< )?.)?.11
I#Internal ;est
1
&<
&= 11.)?.11
8ssignment model# /ungarian method model
8ssignment #ma!imi0ation
1
&=
&? 1&.)?.11
;raeling salesmen method
1
&?
*) 12.)?.11
Problems## ;raeling salesmen method
1 *)
*1 1>.)?.11 Importance of replacement of machines
1
*1
*& 1=.)?.11 @eplacement of items that deteriorate ignoring ;V$
1
*&
** 1?.)?.11 Problems on ;V$
1
**
*1
IV
&&.)?.11 Indiidual replacement policy,
1
*1
*2 &*.)?.11 group replacement policy
1
*2
*> &2.)?.11 problems on replacement *>
*< &>.)?.11 Comparing group or indiidual replacements
1
*<
*= &?.)?.11 7ame theory: Introduction, & person 0ero sum games
1
*=
*? *).)?.11 ma!imin+ minima! principle
1
*?
1) )>.1).11 principle of dominance
1
1)
11 )<.1).11 solution for mi!ed strategy problems
1
11
1& )?.1).11 graphical method for & ! n and m ! & games
1
1&
1* 1).1).11 Solution by LPP
1
1*
11 1*.1).11 Se5uencing models: introduction, general assumptions,
1
11
12
V
11.1).11 8ssumptions in Cohnson,s rule
1
12
1> 1>.1).11 processing of n 3obs through & machines
1
1>
1< 1<.1).11 processing 4n, 3obs through m machines
1
1<
1= &).1).11 processing & 3obs through m machines
1
1=
1? &1.1).11 (!ercise problems
1
1?
2) &1.1).11
:ueuing theory: introduction, single channel + passion
arrials and e!ponential serice
1
2)
21 &<.1).11 Dendal,s notation and 5ueue behaior
1
21
2& &=.1).11 e!ponential serice times %ith infinite and infinite
population
1
2&
2* *).1).11 II#Internal ;est
1
2*
21 *1.1).11 II#Internal ;est
1
21
22 )*.11.11 Problems on single serer, $ulti#channel+ Poisson arrials
+ e!ponential serice
1
22
2> )1.11.11 Introduction to -ptimi0ation ;echni5ues
1
2>
2< )>.11.11
Introduction to 7enetic 8lgorithm, 9S78,$PS-,P-:
1
2<
2= )<.11.11
@eision
1
2=
Note: The number of periods to be planned for 55-60 for semester course.
Signature of the faculty Signature of the !" Signature of the PRI#$IPA%