Excess of service facilities over and above the number of customers results: a. Idleness of service capacity b. Queues c. Both a and b d. None of these

Excess of service facilities over and above the number of customers results:
a. Idleness of service capacity
b. Queues
c. Both a and b
d. None of these
by

1 Answer

Answer :

a. Idleness of service capacity
by

Related questions

In waiting line theory, number of customers waiting in the queue is referred to as ................ a. Traffic intensity b. Queuing system c. Service pattern d. Queue length

Description : In waiting line theory, number of customers waiting in the queue is referred to as ................ a. Traffic intensity b. Queuing system c. Service pattern d. Queue length

Last Answer : d. Queue length

The outlet where the services are being provided to the customers is called................. a. Waiting line b. Service facility c. Idle facility d. Traffic intensity

Description : The outlet where the services are being provided to the customers is called................. a. Waiting line b. Service facility c. Idle facility d. Traffic intensity

Last Answer : b. Service facility

............................refers to the manner in which the customers behave while being in the queue. a. Service pattern b. Service pattern c. Queue discipline d. None of these

Description : ............................refers to the manner in which the customers behave while being in the queue. a. Service pattern b. Service pattern c. Queue discipline d. None of these

Last Answer : c. Queue discipline

A queue is formed when the demand for a service: a. Exceeds the capacity to provide that service b. Is less than the capacity to provide that service c. a or b d. None of these

Description : A queue is formed when the demand for a service: a. Exceeds the capacity to provide that service b. Is less than the capacity to provide that service c. a or b d. None of these

Last Answer : a. Exceeds the capacity to provide that service

Number of customers in the queue per unit of time is called ...................... a. Queuing system b. Length of queue c. Average length of queue d. None of these

Description : Number of customers in the queue per unit of time is called ...................... a. Queuing system b. Length of queue c. Average length of queue d. None of these

Last Answer : c. Average length of queue

In .................. models, everything is defined and the results are certain. a. Probabilistic b. Deterministic c. Both a and b d. None of these

Description : In .................. models, everything is defined and the results are certain. a. Probabilistic b. Deterministic c. Both a and b d. None of these

Last Answer : b. Deterministic

In queuing theory, ............................ stands for mean arrival rate of customers. a. μ b. λ c. t d. none of these

Description : In queuing theory, ............................ stands for mean arrival rate of customers. a. μ b. λ c. t d. none of these

Last Answer : b. λ

A customer’s behaviour of jumping from one queue to another is called ............................ a. Jockying b. Reneging c. Collusion d. Balking

Description : A customer’s behaviour of jumping from one queue to another is called ............................ a. Jockying b. Reneging c. Collusion d. Balking

Last Answer : a. Jockying

A customer’s behaviour of leaving the queue due to impatience is called ....................... a. Jockying b. Reneging c. Collusion d. Balking

Description : A customer’s behaviour of leaving the queue due to impatience is called ....................... a. Jockying b. Reneging c. Collusion d. Balking

Last Answer : b. Reneging

a customer’s behaviour of leaving the queue when he does not like to wait in the queue due to lack of time or space is called ..................... a. Jockying b. Reneging c. Collusion d. Balking

Description : a customer’s behaviour of leaving the queue when he does not like to wait in the queue due to lack of time or space is called ..................... a. Jockying b. Reneging c. Collusion d. Balking

Last Answer : d. Balking

In queuing theory, ...................... refers to those waiting in a queue or receiving service. a. Service provider b. Customer c. Both a and b d. None of these

Description : In queuing theory, ...................... refers to those waiting in a queue or receiving service. a. Service provider b. Customer c. Both a and b d. None of these

Last Answer : b. Customer

The O R technique which helps in minimising total waiting and service cost is: a. Game theory b. Queuing theory c. Both a and b d. Decision theory

Description : The O R technique which helps in minimising total waiting and service cost is: a. Game theory b. Queuing theory c. Both a and b d. Decision theory

Last Answer : b. Queuing theory

Traffic intensity in Queuing Theory is also called........................... a. Service factor b. Arrival factor c. Utilisation factor d. None of these

Description : Traffic intensity in Queuing Theory is also called........................... a. Service factor b. Arrival factor c. Utilisation factor d. None of these

Last Answer : c. Utilisation factor

In queuing theory, ............................ stands for mean service rate. a. μ b. λ c. t d. none of these

Description : In queuing theory, ............................ stands for mean service rate. a. μ b. λ c. t d. none of these

Last Answer : a. μ

Commonly assumed probability distribution of service pattern are ....................... a. Poisson distribution b. Exponential distribution c. Erlang distribution d. b and c

Description : Commonly assumed probability distribution of service pattern are ....................... a. Poisson distribution b. Exponential distribution c. Erlang distribution d. b and c

Last Answer : d. b and c

The ration between mean arrival rate and mean service rate is called ................... a. Idle period b. Average length of queue c. Traffic intensity d. None of these

Description : The ration between mean arrival rate and mean service rate is called ................... a. Idle period b. Average length of queue c. Traffic intensity d. None of these

Last Answer : c. Traffic intensity

In queuing theory, ...................... is a person by whom service is rendered. a. Customer b. Server c. a or b d. none of these

Description : In queuing theory, ...................... is a person by whom service is rendered. a. Customer b. Server c. a or b d. none of these

Last Answer : b. Server

The variables which cannot be manipulated by the decision maker are called.................... a. Controllable variables b. Uncontrollable variables c. Both a and b d. None of these

Description : The variables which cannot be manipulated by the decision maker are called.................... a. Controllable variables b. Uncontrollable variables c. Both a and b d. None of these

Last Answer : b. Uncontrollable variables

The variables which can be manipulated by the decision maker are called.................... a. Controllable variables b. Uncontrollable variables c. Both a and b d. None of these

Description : The variables which can be manipulated by the decision maker are called.................... a. Controllable variables b. Uncontrollable variables c. Both a and b d. None of these

Last Answer : a. Controllable variables

................................is that element of the simplex table which lis both in the key row and key column. a. Key element b. Pivot element c. Both a and b d. None of these

Description : ................................is that element of the simplex table which lis both in the key row and key column. a. Key element b. Pivot element c. Both a and b d. None of these

Last Answer : c. Both a and b

MODI Method to test the optimality of a feasible solution to TP is also called............... a. Stepping Stone Method b. u. v. Method c. both a and b d. none of these

Description : MODI Method to test the optimality of a feasible solution to TP is also called............... a. Stepping Stone Method b. u. v. Method c. both a and b d. none of these

Last Answer : b. u. v. Method

A matrix which shows the gains and losses resulting from moves and counter moves is called.................................. a. Cost matrix b. Pay off matrix c. Both a and b d. None of these

Description : A matrix which shows the gains and losses resulting from moves and counter moves is called.................................. a. Cost matrix b. Pay off matrix c. Both a and b d. None of these

Last Answer : b. Pay off matrix

.......................... is the duration by which an activity can be delayed without delaying the project. a. Slack b. Total float c. Both a and b d. None of these

Description : .......................... is the duration by which an activity can be delayed without delaying the project. a. Slack b. Total float c. Both a and b d. None of these

Last Answer : b. Total float

A Transportation Problem is said to be unbalanced when total supply is not equal to ............ a. Total cost b. Total demand c. Both a and b d. None of these

Description : A Transportation Problem is said to be unbalanced when total supply is not equal to ............ a. Total cost b. Total demand c. Both a and b d. None of these

Last Answer : b. Total demand

Initial feasible solution to a transportation Problem can be found out by ......................... a. VAM b. MODI Method c. Both a and b d. None of these

Description : Initial feasible solution to a transportation Problem can be found out by ......................... a. VAM b. MODI Method c. Both a and b d. None of these

Last Answer : a. VAM

Constraints in an LPP are treated as active, if they: a. Do not consume all the available resources at optimality b. Represent optimal solution c. Both a and b d. None of these

Description : Constraints in an LPP are treated as active, if they: a. Do not consume all the available resources at optimality b. Represent optimal solution c. Both a and b d. None of these

Last Answer : b. Represent optimal solution

Which of the following is true with regard to a Linear Programming Model? a. No guarantee to get integer valued solution b. The relationship among decision variables is liner c. Both a and b d. None of the these

Description : Which of the following is true with regard to a Linear Programming Model? a. No guarantee to get integer valued solution b. The relationship among decision variables is liner c. Both a and b d. None of the these

Last Answer : d. None of the these

Operations Research is a ................................ a. Science b. Art c. Both a and b d. None of these

Description : Operations Research is a ................................ a. Science b. Art c. Both a and b d. None of these

Last Answer : c. Both a and b

Operations Research uses models to help the management in determining its .................... scientifically. a. Policies b. Actions c. Both a and b d. None of these

Description : Operations Research uses models to help the management in determining its .................... scientifically. a. Policies b. Actions c. Both a and b d. None of these

Last Answer : c. Both a and b

Operations Research makes a ...................... attack on complex problems to arrive at optimal solution. a. Scientific b. Systematic c. Both a and b d. None of these

Description : Operations Research makes a ...................... attack on complex problems to arrive at optimal solution. a. Scientific b. Systematic c. Both a and b d. None of these

Last Answer : c. Both a and b

A minimisation problem can be connected into maximisation problem by changing the signs of coefficients in the ........................... a. Constraints b. Objectives c. Both a and b d. None of these

Description : A minimisation problem can be connected into maximisation problem by changing the signs of coefficients in the ........................... a. Constraints b. Objectives c. Both a and b d. None of these

Last Answer : b. Objectives

The Hungarian method for solving an assignment problem can also be used to solve: a. A transportation problem b. A travelling salesman problem c. A linear programming problem d. Both a and b

Description : The Hungarian method for solving an assignment problem can also be used to solve: a. A transportation problem b. A travelling salesman problem c. A linear programming problem d. Both a and b

Last Answer : b. A travelling salesman problem

An assignment problem can be solved by ......................... a. Simplex method b. Transportation method c. Both a and b d. None of these

Description : An assignment problem can be solved by ......................... a. Simplex method b. Transportation method c. Both a and b d. None of these

Last Answer : c. Both a and b

..................... are expressed in the form of equations a. Objectives b. Constraints c. Both a and b d. None of these

Description : ..................... are expressed in the form of equations a. Objectives b. Constraints c. Both a and b d. None of these

Last Answer : b. Constraints

........................ models assume that the values of the variables do not change with time during a particular period. a. Dynamic b. Static c. Both a and b d. None of these

Description : ........................ models assume that the values of the variables do not change with time during a particular period. a. Dynamic b. Static c. Both a and b d. None of these

Last Answer : b. Static

......................are representations of reality. a. Phases b. Models c. Both a and b d. None of these

Description : ......................are representations of reality. a. Phases b. Models c. Both a and b d. None of these

Last Answer : b. Models

The word .................. may be defined as some actions that we apply to some problems or hypothesis. a. Research b. Operations c. Both a and b d. None of these

Description : The word .................. may be defined as some actions that we apply to some problems or hypothesis. a. Research b. Operations c. Both a and b d. None of these

Last Answer : b. Operations

......................... models involve more risks and uncertainties. a. Probabilistic b. Deterministic c. Both a and b d. None of these

Description : ......................... models involve more risks and uncertainties. a. Probabilistic b. Deterministic c. Both a and b d. None of these

Last Answer : a. Probabilistic

Operations Research cannot give perfect .................. to the problem. a. Answers b. Solutions c. Both a and b d. Decisions

Description : Operations Research cannot give perfect .................. to the problem. a. Answers b. Solutions c. Both a and b d. Decisions

Last Answer : c. Both a and b

The solution to a transportation problem with ‘m’ rows and ‘n’ columns is feasible if the number of positive allocations are: a. m + n b. m x n c. m +n – 1 d. m +n + 1

Description : The solution to a transportation problem with ‘m’ rows and ‘n’ columns is feasible if the number of positive allocations are: a. m + n b. m x n c. m +n – 1 d. m +n + 1

Last Answer : c. m +n – 1

If a simplex table shows the values 2, -3, 0 against “θ”, which should be taken as the replacement ratio. a. 2 b. -3 c. 0 d. None of these

Description : If a simplex table shows the values 2, -3, 0 against “θ”, which should be taken as the replacement ratio. a. 2 b. -3 c. 0 d. None of these

Last Answer : c. 0

Controllable variables are also called.................................. a. Slack variables b. Surplus variables c. Artificial variable d. Decision variables

Description : Controllable variables are also called.................................. a. Slack variables b. Surplus variables c. Artificial variable d. Decision variables

Last Answer : d. Decision variables

.................... is the popular method for solving an assignment problem. a. Hungarian Method b. Enumeration Method c. Simplex Method d. None of the above

Description : .................... is the popular method for solving an assignment problem. a. Hungarian Method b. Enumeration Method c. Simplex Method d. None of the above

Last Answer : a. Hungarian Method

Hungarian method was developed by ........................ a. T C Koopman b. F L Hitchcock c. D Konig d. George B Dantzig

Description : Hungarian method was developed by ........................ a. T C Koopman b. F L Hitchcock c. D Konig d. George B Dantzig

Last Answer : c. D Konig

Which of the following methods is used to solve an assignment problem: a. Enumeration Method b. Hungarian Method c. Simplex Method d. All of the above

Description : Which of the following methods is used to solve an assignment problem: a. Enumeration Method b. Hungarian Method c. Simplex Method d. All of the above

Last Answer : d. All of the above

VAM is also called........................ a. Matrix Minima Method b. Penalty Method c. MODI Method d. None of these

Description : VAM is also called........................ a. Matrix Minima Method b. Penalty Method c. MODI Method d. None of these

Last Answer : b. Penalty Method

Transportation model was first introduced by ........................ in the year 1941. a. T C Koopman b. George B Dantzig c. Von-neumann d. F L Hitchcock

Description : Transportation model was first introduced by ........................ in the year 1941. a. T C Koopman b. George B Dantzig c. Von-neumann d. F L Hitchcock

Last Answer : d. F L Hitchcock

Shadow price is also called ...................... a. Dual price b. Unit price c. Total cost d. None of these

Description : Shadow price is also called ...................... a. Dual price b. Unit price c. Total cost d. None of these

Last Answer : a. Dual price

Which of the following is a characteristic of a dual problem: a. Dual of a dual is primal b. If dual has a finite optimal solution, then the primal also has finite optimal solution c. If dual has no feasible solution, then the primal also has no feasible solution d. All of the above

Description : Which of the following is a characteristic of a dual problem: a. Dual of a dual is primal b. If dual has a finite optimal solution, then the primal also has finite optimal solution c. If dual has no feasible solution, then the primal also has no feasible solution d. All of the above

Last Answer : d. All of the above

Game theory became popular when the book “Theory of Games and Economic Behaviour” was published in 1944 by .............................. a. Von Neumann b. Mc Closky c. Von-Neumann and Mc Closky d. Von-neumann and Morgenstern

Description : Game theory became popular when the book “Theory of Games and Economic Behaviour” was published in 1944 by .............................. a. Von Neumann b. Mc Closky c. Von-Neumann and Mc Closky d. Von-neumann and Morgenstern

Last Answer : d. Von-neumann and Morgenstern