EHS405: OPERATIONS RESEARCH (IDE

I)

L T P C
3 0 0 3

This course is to aid decision making and improving efficiency of the system by applying advanced analytical
methods. This course addresses a number of quantitative tools and techniques, and provides students with
knowledge and skills needed to apply these tools and techniques for decision making in organizations.

Course Objectives:

 To Introduce the basics of Operations research, formulation and solution of Linear Programming Problems
using different methods
 To Learn Formulation and solve problems of optimization problems in transportation and assignment of
jobs.
 To explore different queuing models and sequencing techniques for optimal schedule of jobs on machines
 To impart knowledge on replacement policies for estimation of economic life of equipment and the concept
of game theory to arrive at the optimal business strategy for a given situation.
 To introduce basic inventory models to optimize inventory costs and Project scheduling techniques – CPM
& PERT for optimum time and costs

UNIT- I 10L
Basics of Operations Research: History, definition, operations research models, phases of implementing
operations research in practice.
Linear Programming: Introduction, formulation, graphical solution, simplex method, artificial variable
techniques – Big M and Two Phase methods, concept of duality, dual simplex method.
Learning Outcome:
After completion of Module-I, the students will be able to:

 recognize the significance of Operations Research and mathematical modelling while analyzing the
practical problems in industry (L1)
 formulate the various linear Programming Models (L6)

 evaluate the optimal solution to simple linear programming problems (L4)

UNIT- II 8L
Transportation Model: Formulation, methods for initial feasible solution, optimal solution – MODI method,
unbalanced transportation problems, degeneracy in transportation problems.
Assignment Model: Formulation, optimal solution, Hungarian method, travelling salesman problem.
Learning Outcome:
After completion of Module-II, the students will be able to:

 formulate the linear programming problem as a Transportation model (L6)

 formulate the linear programming problem as an Assignment model (L6)
 evaluate the optimal solution to Transportation Problems (L4)
 evaluate the optimal solution to Assignment Problems (L4)

UNIT- III 8L
Queuing Models: Introduction, Kendall’s notation, classification of queuing models, single server and multi-
server models, Poisson arrival, exponential service, infinite population
Sequencing Models: Introduction, assumptions, processing n-jobs through two machines, n-jobs through three
machines, n-jobs through m-machines, graphic solution for processing 2 jobs through n machines with
different order of sequence
Learning Outcome:
After completion of Module-III, the students will be able to:

 define the various queuing models(L1)

 calculate Queue length & waiting time of a given queue system(L3)
 evaluate the optimal sequence of the jobs on machines for minimum cycle time(L4)

UNIT- IV 9L
Replacement Models: Introduction, replacement of items that deteriorate with time - value of money unchanging
and changing, simple probabilistic model for replacement of items that fail completely.
Game Theory: Introduction, game with pure strategies, game with mixed strategies, dominance principle,
graphical method for 2xn and mx2 games, linear programming approach for game theory.
Learning Outcome:
After completion of Module-IV, the students will be able to:

 analyze the replacement and maintenance costs of items under various replacement policies (L4)
 evaluate the optimal replacement policy of items (L4)
  analyze the players’ strategies and thereby Evaluate optimal business strategies for the players (L4)

UNIT- V 9L
Inventory Models: Introduction, inventory costs, Economic Order Quantity (EOQ) and Economic Batch Quantity
(EBQ) models with and without shortages, inventory models with quantity discounts
Project Management: Introduction, phases of project management, network construction, numbering the events-
Fulkerson’s rule, Critical Path Method (CPM), Programme Evaluation and Review Technique (PERT)
Learning Outcome:
After completion of Module-V, the students will be able to:

 recognize the significance of Inventory models & Project Management in real world industrial
scenarios (L1)
 differentiate between the critical and non-critical activities of a given project (L4)
 propose the optimal schedule of the activities involved in a project (L6)
 evaluate the optimal order/batch quantity for minimum inventory cost (L4)

Course Outcomes:
After successful completion of this course, the students will be able to

 develop the mathematical models and Propose the optimal resource allocation (L3&L6)
 formulate and solve transportation & assignment models for optimum resources (L6&L3)
 analyze the queue system and to propose the optimal sequence of jobs on machines (L4 & L6)
 evaluate the optimal replacement policy of the equipment and to analyze the strategic interaction
between rational decision-makers (L6&L4)
 design the inventory systems and to plan the project activities (L6)

Text Book(s):
1. Gupta P K. & Hira D.S., Operation Research, 6/e, S Chand Publishers, 2006.
2. Paneerselvam R., Operations Research, 2/e, Prentice Hall of India, 2010.