OPERATIONS RESEARCH TWO MARKS QUESTIONS AND ANSWERS

Similar documents
OPERATIONS RESEARCH Code: MB0048. Section-A

INDIAN INSTITUTE OF MATERIALS MANAGEMENT Post Graduate Diploma in Materials Management PAPER 18 C OPERATIONS RESEARCH.

QUESTION BANK BCA V SEMESTER BCA-505 OPTIMAZATION TECHNIQUES

SEQUENCING & SCHEDULING

MBP1123 Project Scope, Time and Cost Management Prepared by Dr Khairul Anuar

3. Transportation Problem (Part 1)

Project Time Management

6 PROJECT TIME MANAGEMENT

University Question Paper Two Marks

Geog 469 GIS Workshop. Project Management

ISE 204 OR II. Chapter 8 The Transportation and Assignment Problems. Asst. Prof. Dr. Deniz TÜRSEL ELİİYİ

Code No: RR Set No. 1

Lecture- 10. Project Scheduling. Dronacharya College of Engineering

MBH1123 Project Scope, Time and Cost Management Prepared by Dr Khairul Anuar. Lecture 6b Project Time Management - II

Operation and supply chain management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology Madras

2. Solve the following LPP by Graphical method

Transportation problem

MBP1133 Project Management Framework Prepared by Dr Khairul Anuar

Modern Systems Analysis and Design Seventh Edition

Model Question Paper with Solution

SCHEDULING AND CONTROLLING PRODUCTION ACTIVITIES

Transportation Problems

Transportation Theory and Applications

PLANNING & SCHEDULING

Estimating Project Schedule-Time and Cost

Optimal Solution of Transportation Problem Based on Revised Distribution Method

Techniques of Operations Research

CE2353-CONSTRUCTION PLANNING & SCHEDULING

Assignment Technique for solving Transportation Problem A Case Study

Prepared by: Mr.M.SYED SHAHUL HAMEED CHAPTER 3 SYSTEMS PLANNING - MANAGING SYSTEMS PROJECTS

B.E. Sixth Semester (Mechanical Engineering) (C.B.S.) Operations Research

The Transportation Problem

SYLLABUS OSMANIA UNIVERSITY (HYDERABAD) INDUSTRIAL ORGANIZATION

Scheduling Resources and Costs

Charting and Diagramming Techniques for Operations Analysis. How to Analyze the Chart or Diagram. Checklist of Questions - Example

The Study of Using LP to Solve Flower Transport Problem

Artificial Intelligence

Chapter 5 Project Scheduling. (Source: Pressman, R. Software Engineering: A Practitioner s Approach. McGraw-Hill,

DEA Model: A Key Technology for the Future

CIS QA LEVEL 2 WEEK 5 TOPIC: LINEAR PROGRAMMING OBJECTIVE AND SHORT ANSWER QUESTIONS

Operations Management

Constructing Networks

(Assignment) Master of Business Administration (MBA) PGDPM Subject : Management Subject Code : PGDPM

Planning & Scheduling

SYLLABUS Class: - B.B.A. IV Semester. Subject: - Operations Research

Information Technology Project Management, Seventh Edition

Scheduling. Adapted from John Musser

Project Management. Learning Objectives. What are Projects? Dr. Richard Jerz. Describe or Explain:

Project Management. Dr. Richard Jerz rjerz.com

FIGURE 8-8 Computer Printout of Sewer Line Activities Only (Sort of Activities List by Code Digit #I Equal to One).

Manufacturing Resource Planning

Basic Linear Programming Concepts. Lecture 2 (3/29/2017)

Introduction to Project Management

Learning Objectives. Scheduling. Learning Objectives

CC 01-Principles & Practices of Management

CHAPTER 1. Basic Concepts on Planning and Scheduling

1. are generally independent of the volume of units produced and sold. a. Fixed costs b. Variable costs c. Profits d.

What Should an Owner Do With the Contractor s Schedules? Seminar for the FEFPA Ted Trauner Trauner Consulting Services, Inc.

Information Technology Audit & Cyber Security

Implementing Resource Scheduling Techniques

Question Paper Code: 60837

SCSD2613 System Analysis and Design. PART II: Project Planning Process

MODULE 15 OPERATIONAL PLANNING TECHNIQUES (USE OF PLANNING TOOLS LIKE GANTT CHART, PERT/CPM)

International Journal of Mathematics Trends and Technology (IJMTT) Volume 44 Number 4 April 2017

Identification of Bottleneck and Reducing Cycle Time of an Industrial Oven by Using Project Management Techniques

JOB SHOP SCHEDULING TO MINIMIZE WORK-IN-PROCESS, EARLINESS AND TARDINESS COSTS ZHU ZHECHENG A THESIS SUBMITTED FOR THE DEGREE OF DOCTOR OF PHILOSOPHY

CHAPTER 4 A NEW ALTERNATE METHOD OF TRANS-SHIPMENT PROBLEM

INPUTS PROCESS OUTPUTS

Cambridge International AS & A Level Computer Science

Chapter-7# Project Controlling and Scheduling

Seminar 6: Project Management Part 1 Semester 1, 2005

Seminar 6: Project Management Part 1 Semester 1, 2005

Resource Portal for Management Sciences Students, Teachers and Business Professionals. Visit

PMP Exam Preparation Course Project Time Management

Luis R. Garcilaso March 13, Lecture #22. Service Processes & Systems Dept. of Mechanical Engineering - Engineering Mechanics

PROJECT PLANNING AND SCHEDULING

Linear programming A large number of decision pr

LOADING AND SEQUENCING JOBS WITH A FASTEST MACHINE AMONG OTHERS

Planning & scheduling

Software Project Management. Chapter 8. allocation

CHAPTER 1 INTRODUCTION

1. Introduction to Operations Research (OR)

B.1 Transportation Review Questions

12/26/2013. Sharif University of Technology. Session#11. Instructor. Class time. Course evaluation. International Campus Kish

Sequencing Problem. Dr.S.S.Kulkarni

PROJECT MANAGEMENT. Systems, Principles, and Applications. Taylor & Francis Group Boca Raton London New York

December 25, 2017 CHAPTER 4 SUPPORTING PLANNING AND CONTROL: A CASE EXAMPLE

PRODUCTION SCHEDULING PART-A

A Study on North East Corner Method in Transportation Problem of Operations Research and using of Object Oriented Programming Model

CHAPTER II SEQUENCING MODELS

Network Diagram 11/10/2016 WORK BREAKDOWN STRUCTURE (WBS)

Statistical Investigation of Various Methods to Find the Initial Basic Feasible Solution of a Transportation Problem

Project Time Management

A New Networking Technique The Beeline Diagramming Method Seon-Gyoo Kim

Applied Data Analysis (Operations Research)

International Association of Certified Practicing Engineers

SOMANI S Approximation Method(SAM) Innovative Method for finding optimal Transportation Cost. Abstract

Simplex Method Linear Program Application In Process Of Transition To Reduce Use Of Products In Polyster Material In Indonesia

LECTURE 41: SCHEDULING

Application of Transportation Linear Programming Algorithms to Cost Reduction in Nigeria Soft Drinks Industry

Transcription:

OPERATIONS RESEARCH TWO MARKS QUESTIONS AND ANSWERS 1.when does degenaracy happen in transportation problem? In transportation problem with m orgins and n destinations, if a IBFS has less than m+n-1 allocations, the problem is said to be a degenerate problem. 2.what is an unbalanced transportation problem? *If the total availability from all origins is not equal to the total demand of all destinations,then it is called unbalanced transportation problem. *The transportation problem is balanced if the total availability is equal to total demand. *An IBFS can be obtained only for balanced transportation problem. 3.What is an assignment problem? Given n facilities and n jobs and given the effectiveness of each facility for each job, the problem is to assign each facility to one and only job so as to optimize the given measure of effectiveness. 4.What is an unbalanced assignment problem? An assignment problem is an unbalanced problem if the number of jobs is not equal to no.of facilities.the Hungarian method of solution requires a square matrix.hence fictitious facilities or jobs are added and assigned 0 costs to the corresponding cells of the matrix.these cells are treated the same way as the real cost cells during the solution procedure. 5.What is a trvelling salesman problem? There are a no.of cities a salesman must visit.the distance(or time or cost)between every pair of cities is known.he starts from his homecity, passes through each city once and only ones and returns to his homecity. The problem is to find the routes shortest in distance(or time or cost). 6.Define sequencing problem. sequencing problem involves the determination of an optimal order or sequence of performing a series of jobs by a no.of facilities/machines so as to optimize the total time or cost. 7. What is 'No passing rule' in sequencing? If each of the n jopbs are to be proceesed through 2 machines A and B in the order A and B, then this rule means that each job will go to machine A 1st and then to machine B.

8.What is total elapsed time? It is the time between starting the 1st job and completing the last one. 9. Define Idle time on a machine in a sequencing problem. It is the time the machine remains idle i.e. (without work) during the elapsed time is the idle time. 10.What is network? A Network is a symbolic representation of the essential characteristics of a project.network technique is a tool of project management. PERT and CPM are the widely applied techniques. 11.Define event float in CPM. The beginning and end points of an activity are called events or nodes.event is a point in time and does not consume any resources.it is represented by a circle. 12.What is meant by network constrution? The project is split into activities.start project and finish events of the project are then decided.after deciding the precedence order, the activities are put in a logical sequence by using the graphical notations. 13.What is meant by critical path? The critical path of a network gives the shortest time in which the whole project can be completed.it is the chain of activities with the longest time duration.any delay in any of the activities results in the delay of the completion of the project.

14.What is meant LPP? Linear programming problem deals with the optimization (maximization or minimization) of a function of decision variables subject to a set of constraints. 15,Define a slack variables. Non-negative variables that are added to the left hand side of < = constraints to convert them to equalities are called as slack variables. 16.Define a surplus variables. Non-negative variables that are subtracted from the left hand side of > = constraints to convert them to equalities are called surplus variables. 17.Define Basic feasible solution. It is a Basic feasible solution that also satisfies the Non-negativity restrictions.all variables in a Basic solution are > = 0. 18.Define O.R. Operations Research is the application of scientific methods, techniques and tools to operations of systems to obtain optimal solution to the problems,it provides a quantitative technique to the managers for making better decisions for operations under control. 19. What is an Iconic or physical model in O.R.? This is a physical or a pictorial representation of various aspects of a system. Properties of the real system are represented by the properties themselves with a change of scale. (e.g). Model of solar system, Scaled up model of a cell in biology. 20.Write applications of O.R. *Prodution,blending,productmix.

*Inventory control, demand forecast,sale and purchase. *Transportation,repair and maintanance,scheduling and sequencing. *Planning,scheduling and controlling of projects. *Optimal allocation of men,machines,materials,time and money. *Location and size of warehouses,distributions centres,retail depots,etc. *Cash management so that all sections are departments receive adequate supply of funds. 21.Define objective function and constraints in LPP? It is a function of decision variables whose value must be optimized (maximized or minimized) It is a set of simultaneous linear equations(or in equalities). 22.Define optimum basic feasible solution? It is the basic feasible solution that also optimizes the objective function. 23.Define artificial variable? Non-negative variables that are added to the constraints of(>=) or (=)type.the purpose of introducing artificial variables is just to obtain an initial basic feasible solution. 24.Define the term "ACTIVITY"in a network? It is a physically identifible part of a project which requries time and resources for execution.an activity is represented by an arrow,the tail of which represents that start and the head,the finish of the activity. 25. Write down any four rules of network construction? *Each activity is represented by one and only one arrow. *Time flows from left to right. *Arrows should be straight and not curved.

*Arrows should not cross each other where crossing cannot be avioded,bridging should be done. 26.What are the three phases in the scientific method of OR? *Judgement phase, *Research phase, *Action phase. 27.Write the expansion of PERT and CPM? PERT: CPM: Project evaluation and research technique. Critical path method. 28.Define a slack variable?how many slack variables would you using a LPP? Non-negative variables that are added to the left hand side of >= constraints to convert them to equalities are called as slack variables. 29.Write the cannonical form of LPP? The general form of LPP can be expressed in the cannonical form as follows, maximize Z= cj xj n j=1 subject to aij xj<=bi (i=1,2,3,...m) xj>=0. 30.What is the relation between assignment and transportation promblems? The transportation problem deals with the transportation of a product manufactured at different plants or factories(supply origins)to a number of different warehouses(demand destinations).the objective is to satisfy the destination requirement within the plant capacity at minimum transportation cost.

Given n facilities and n jobs and given the effectiveness of each facility for each job,the problem is to assign each facility to one only job so as to optimize the given measure of effectiveness. Examples:products to factories jobs to machines. 31.How do you convert an unbalanced assignment problem into a balanced assingment problem? If no.of rows>no.of columns,then add extra one column and set cost as (0), If no.of columns>no.of rows,then add extra one row and set cost as (0), then the unbalanced assignment problem is converted into balanced assingnment problem. 32.State any two methods for finding initial basic feasible solution in a transportation problem? *Total demand=total supply, *No.of allocations=m+n-1, these are the two methods for finding the initial basic solution in a transportation problem. 33.Define standard form of LPP? The standard form of LPP can be expressed as follows max or min, n Z= cj xj j=1 subject to aij xj=bi (i=1,2,...m) j=1 xi >=0, bi>=0.