VARDHAMAN COLLEGE OF ENGINEERING

(Autonomous)
Shamshabad, Hyderabad 501 218

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING VCE R 11 Regulations VII Semester COURSE DESCRIPTION
Course Code Course Title Course Structure : :
:

AME11T20 OPERATIONS RESEARCH Lectures 4 Tutorials Practicals Credits 4

Course Coordinator Team of Instructors I. Course Overview:

: :

Dr. S. Deva Prasad Dr. S. Deva Prasad and Prof. N. Srinivasa Reddy

Operations Research (OR) helps to analyze and design a methodology to solve problems in different industrial environments that need decisions to be taken and implemented. Decision - making is becoming more and more complex. This course exposes the students to the significance of various scientific tools and models that are available in operations research This course covers fundamental methods of Operations Research and their applications at an introductory level. The emphasis is on applications rather than the details of methodology. By the end of the course, students will be exposed to a wide variety of applications and problems from areas such as linear programming formulation with simplex method, optimization study of transportation and assignment problems, sequencing, replacement methods, decision theory, waiting lines, inventory models, and dynamic programming that can be addressed in view of decision making as a quantitative tools. II. Prerequisite(s): Level UG III. Marks Distribution: Sessional Marks Continuous Assessment Tests There will be two Continuous Assessment Tests in theory courses having a weight age of 10 marks to be answered in two hours duration each. The th first Continuous Assessment Test will be held in the 7 week with the announced schedule in the first two units of syllabus. The second Continuous Assessment Test will be held at the end of the semester with the announced schedule in the fourth and fifth units of syllabus. Marks shall be awarded considering the average of two Continuous Assessment Tests in each course. In case a student does not appear in the Continuous Assessment Tests due to any reason whatsoever, will get zero marks(s). University End Exam Marks Total Marks Credits 4 Periods / Week 4 Prerequisites Basic calculus, Elementary probability and statistics

75

100

1|Page

Mid Semester Test There will be one Mid Semester Test in theory courses for a maximum of 15 marks to be answered in two hours duration. The Mid Semester Test will be th held in the 10 week with the announced schedule in the first three units of syllabus. In case a student does not appear in the Mid Semester Test due to any reason whatsoever, will get zero marks(s). IV. Evaluation Scheme: Continuous Assessment Test Mid Semester Test End Semester Examination V. 10 marks 15 marks 75 marks

Course Objectives: To enable the student to understand and apply operations research techniques in formulating industrial decision making environment. II. To facilitate the students to design a quantitative method to analyze the data and for identifying a suitable solution for the formulations. III. To create awareness about the importance of optimization to utilize industrial resources optimally. IV. To enable the students in understanding the nuances of problem solving through operations research models. V. To develop professional and ethical attitude, effective communication skills, leadership, teamwork skill, multidisciplinary approach and create an ability to relate decision making issues to a broader social context. VI. To develop skills of programming using recent simulation software for solving practical industrial problems. VII. To gain experience of doing independent study and research. I. Course Outcomes: 1. Graduates will demonstrate the ability to use knowledge in mathematics, science and engineering and apply them to solve problems specific to mechanical engineering. 2. Graduates will demonstrate the ability to identify, formulate and solve mechanical engineering problems of a basic to moderate kind of difficulty in industrial decision making environment. 3. Graduates will demonstrate an understanding of their professional and ethical responsibilities, and use technology for the benefit of mankind. 4. Graduates will be able to communicate effectively in both verbal and written forms. 5. Graduates will have the confidence to apply engineering solutions in global and societal contexts. 6. Graduates should be capable of self-education and clearly understand the value of life-long learning. 7. Graduates will develop an open mind and have an understanding of the impact of engineering on society and demonstrate awareness of contemporary issues. 8. Graduates will be familiar with applying software methods and modern computer tools to analyze mechanical engineering problems. 9. Graduates will have the ability to recognize the importance of professional development by pursing post graduate studies or face competitive examinations that offer challenging and rewarding careers in Mechanical Engineering. 10. Graduate will be able to design a system to meet desired needs within environmental, economic, political, ethical health and safety, manufacturability and management knowledge and techniques to estimate time, resources to complete project.

VI.

2|Page

VII.

How Course Outcomes are assessed: Outcome A An ability to apply knowledge of computing, mathematical foundations, algorithmic principles, and computer science and engineering theory in the modeling and design of computer based systems to real-world problems. An ability to design and conduct experiments, as well as to analyze and interpret data. An ability to design, implement, and evaluate a computer-based system, process, component, or program to meet desired needs, within realistic constraints such as economic, environmental, social, political, health and safety, manufacturability, and sustainability. An ability to function effectively on multi-disciplinary teams. An ability to analyze a problem, and identify, formulate and use the appropriate computing and engineering requirements for obtaining its solution. An understanding of professional, ethical, legal, security and social issues and responsibilities. An ability to communicate effectively, both in writing and orally. The broad education necessary to analyze the local and global impact of computing and engineering solutions on individuals, organizations, and society. Recognition of the need for, and an ability to engage in continuing professional development and life-long learning. Knowledge of contemporary issues. An ability to use current techniques, skills, and tools necessary for computing and engineering practice. An ability to apply design and development principles in the construction of software and hardware systems of varying complexity. An ability to recognize the importance of professional development by pursuing postgraduate studies or face competitive examinations that offer challenging and rewarding careers in computing. N = None S = Supportive Level Proficiency assessed by Tutorial, exam

B C

Tutorial, exam

S S H S S S S S N S S

Tutorial Tutorial Tutorial, exam Tutorial Tutorial Tutorial Tutorial ----Exam Exam

D E

F G H

I J K L M

H = Highly Related

VIII.

Syllabus: UNIT I INTRODUCTION TO OPERATIONS RESEARCH: Basics definition, scope, objectives, phases, models and limitations of Operations Research. Linear Programming Problem, Formulation and Graphical solution of Linear Programming Problem. Simplex Method, Artificial variables Techniques, big -M method, two -phase simplex method, degeneracy and unbound solutions. UNIT II TRANSPORTATION PROBLEM: Formulation, solution, unbalanced Transportation problem. Finding basic feasible solutions, North-West corner rule, least cost method and Vogels approximation method. Optimality test MODI method. ASSIGNMENT MODEL: Formulation, Hungarian method for optimal solution, solving unbalanced problem, Traveling salesman problem as assignment problem. UNIT III SEQUENCING MODELS: Solution of Sequencing Problem, Processing n Jobs through two machines, Processing n Jobs through three machines, Processing two Jobs through m machines, Processing n Jobs through m Machines.

3|Page

QUEUING THEORY: Introduction, Single Channel, Poisson arrivals, exponential service times with infinite population and finite population models. UNIT IV REPLACEMENT MODELS: Replacement of Items that Deteriorate whose maintenance costs increase with time without change in the money value, Replacement of items that fail suddenly, individual replacement policy, group replacement policy. INVENTORY MODELS: Inventory costs, Models with deterministic demand model: (a) Demand rate uniform and production rate infinite, (b) Demand rate non-uniform and production rate infinite, (c) Demand rate uniform and production rate finite. UNIT V GAME THEORY: Competitive game, rectangular game, saddle point, minimax (maximin) method of optimal strategies, value of the game. Solution of games with saddle points, dominance principle, Rectangular games without saddle point, mixed strategy for 2 X 2 games. DYNAMIC PROGRAMMING: Characteristics of dynamic programming, Dynamic programming approach for priority management employment smoothening, Capital budgeting, Stage Coach/Shortest Path, cargo loading and Reliability problems.

IX.

List of Text Books / References / Websites / Journals / Others Text Books: 1. M. Natarajan, P. Balasubramani, A. Tamilarasi (2006), Operations Research, Pearson Education, India. 2. S. D. Shama (2009), Operation Research, Tata McGraw Hill, New Delhi. Reference Books: 1. J. K. Sharma (2007), Operations Research Theory and Applications, 3rd edition, Macmillan India Ltd, India. 2. R. Panneerselvam (2008), Operations Research, 2nd edition, Prentice Hall of India, India. 3. F. S. Hillier, G. J. Lieberman (2007), Introduction to Operations Research, 8th edition, Tata McGraw Hill, New Delhi, India.

X.

Course Plan: The course plan is meant as a guideline. There may probably be changes. Lecture No. 1-2 Learning Objective Origin, Importance of Operations Research, Progress of application as a subject Linear Formulation of real world descriptive of a industrial scenario and its analysis Analysis and solving complex linear formulations Analysis and solving complex linear formulations Understanding a domain of transportation and its formulation Generation of optimal solution Study, formulate and solve assignment problem Topics to be covered Development Definition Characteristics and Phases Types of models operation Research models applications. Linear Programming Problem, Formulation, Graphical solution. Simplex Method, Artificial variables Techniques, big -M method. two -phase simplex method, duality principle TRANSPORTATION PROBLEM: Formulation, unbalanced Transportation problem. optimal solution stepping stone method, modi method ASSIGNMENT Problem: Formulation, Hungarian method for optimal solution, solving unbalanced problem. Reference
T1 - Section 1.2, 1.4, 1.7, 1.8, 1.10 T1 Section 2.1, 2.2, 2.3, 2.4 T1 Section 2.5, 2.6 T1 Section 2.6 T1 Section 4.1, 4.2, T1 Section 4.3, 4.4 T1 Section 5.1, 5.2, 5.3

3-5

6-7 8-12 13-14

15-20 21-22

4|Page

Lecture No. 23-25 26-27

Learning Objective Assignment problem as a TSP Importance of sequencing and flowshop scenario Understanding job shop scenario

Topics to be covered Traveling salesman problem as assignment problem SEQUENCING: Introduction Flowshop Sequencing, Processing n Jobs through two machines Processing n Jobs through three machines, Job shop sequencing - Processing two Jobs through m machines REPLACEMENT MODELS: Replacement of items that Deteriorate whose maintenance costs increase with time without change in the money value Replacement of items that fail suddenly, individual replacement policy, group replacement policy THEORY OF GAMES : Introduction Minimax (maximin) 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. QUEUING THEORY: Introduction, Single Channel, Poisson arrivals, exponential service times with infinite population and finite population models. Multichannel Poisson arrivals exponential service times with infinite population INVENTORY : 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. DYNAMIC PROGRAMMING: Introduction Bellmans Principle of optimality. Applications of dynamic programming- capital budgeting problem. shortest path problem linear programming problem SIMULATION : Definition- phases of simulation Types of simulation models applications of simulation Inventory and Queuing problems Advantages and Disadvantages Simulation Languages.

Reference
T1 Section 5.5 T1 Section 8.1, 8.2. T1 Section 8.3, 8.4, 8.5. T1 Section 9.1, 9.2.

28-30

31-34

Importance of Replacement with money value

35-36

Different approaches to replace

T1 Section 9.3 T1 Section 7.6

38

World of development of Game theory

39-40

World of development of Game theory Study, formulate and analyse Waiting Lines

T1 Section 7.7 T1 Section 11.1, 11.2.

41-42

43

Study, formulate and analyse Waiting Lines Study and analyse Inventory

T1 Section 11.3 T1 Section 10.1, 10.2, 10.3.1 T1 Section 10.3.5 T1 Section 10.3.7 T1 Section 6.1 T1 Section 6.3 T1 Section 6.5 T1 Section 13.1, 13.2 T1 Section 13.3, 13.4 T1 Section 13.5, 13.6 T1 Section 13.10

44

45

Study and analyse Inventory when shortages are not allowed Study and analyse Inventory under a instantaneous production/demand scenario The domain of Dynamic Programming Application of Dynamic Programming Application of Dynamic Programming Simulation and its importance in decision making Simulation and its importance in decision making Simulation and its importance in decision making Simulation and its languages in computers era.

46-47

48 49-50 51-52 53-55 56-57 58-59 60-62

5|Page

XI.

Mapping course objectives leading to the achievement of the programme outcomes: Course Objectives I II III IV V VI VII Programme Outcomes a H H S S S S S S H = Highly Related S S H H S S S = Supportive b H H H c d e H f g S h i j S k S l m

XII.

Mapping course outcomes leading to the achievement of the programme outcomes: Course Outcomes 1 2 3 4 5 6 7 8 9 10 11 S = Supportive H = Highly Related H S S S S S S H S S S H Programme Outcomes a S S b H S c S H S S S S H H S S S d S e S H S H S f g h i S j k l m

Prepared By Date

: :

Dr. S. Deva Prasad

6|Page