R-20 Syllabus for ME JNTUK w. e.f.
2020–21
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA–533003, Andhra Pradesh, India
DEPARTMENT OF MECHANICAL ENGINEERING
L T P C
IV Year - I Semester
3 0 0 3
OPERATIONS RESEARCH (PE-3)
Course Objectives:
1. Understand Linear Programming models
2. Interpret Transportation and sequencing problems
3. Solve replacement problems and analyze queuing models
4. Understand game theory and inventory problems
5. Interpret dynamic programming and simulation.
UNIT– I:
INTRODUCTION - definition– characteristics and phases – types of operation research models –
applications.
ALLOCATION: Linear programming problem formulation – graphical solution – simplex method
– artificial variables techniques -two–phase method, big-M method – duality principle.
UNIT– II:
TRANSPORTATION PROBLEM: Formulation – optimal solution, unbalanced transportation
problem – degeneracy, assignment problem – formulation – optimal solution - variants of
assignment problem- travelling salesman problem.
SEQUENCING – Introduction – flow –shop sequencing – n jobs through two machines – n jobs
through three machines – job shop sequencing – two jobs through ‘m’ machines.
UNIT– III:
REPLACEMENT: Introduction – replacement of items that deteriorate with time – when money
value is not counted and counted – replacement of items that fail completely, group replacement.
THEORY OF GAMES: Introduction – mini. max (max. mini) – criterion and optimal strategy –
solution of games with saddle points – rectangular games without saddle points – 2 x 2 games –
dominance principle – m x 2 & 2 x n games -graphical method.
UNIT– IV:
WAITING LINES: Introduction – single channel – poison arrivals – exponential service times –
with infinite population and finite population models– multichannel – poison arrivals – exponential
service times with infinite population single channel.
INVENTORY CONTROL : Introduction – single item – deterministic models – purchase
inventory models with one price break and multiple price breaks – shortages are not allowed –
stochastic models – demand may be discrete variable or continuous variable – instantaneous
production. Instantaneous demand and continuous demand and no set up cost. ABC & VED
Analysis.
R-20 Syllabus for ME JNTUK w. e.f.2020–21
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA
KAKINADA–533003, Andhra Pradesh, India
DEPARTMENT OF MECHANICAL ENGINEERING
UNIT– V:
DYNAMIC PROGRAMMING: Introduction – Bellman’s principle of optimality – applications of
dynamic programming- capital budgeting problem – shortest path problem – linear programming
problem.
SIMULATION: Definition – types of simulation models – phases of simulation– applications of
simulation – inventory and queuing problems – advantages and disadvantages – simulation
languages.
TEXT BOOKS:
1. Operations Research-An Introduction/Hamdy A Taha/Pearson publishers
2. Operations Research –Theory & publications / S.D.Sharma-Kedarnath/McMillan publishers
India.
REFERENCES:
1. Introduction to O.R/Hiller & Libermann/TMH
2. Operations Research /A.M. Natarajan, P. Balasubramani, A. Tamilarasi /Pearson Education.
3. Operations Research: Methods & Problems / Maurice Saseini, Arhur Yaspan & Lawrence
Friedman/Wiley
Course Outcomes: At the end of the course, student will be able to
CO1: Understand Linear Programming models.
CO2: Interpret Transportation and sequencing problems.
CO3: Solve replacement problems and analyze queuing models.
CO4: Understand game theory and inventory problems.
CO5: Interpret dynamic programming and simulation.
