Deck 7: Queuing Systems

Question 1

An assignment problem is considered as a particular case of a transportation problem because

A) The number of rows equals columns
B) All xij = 0 or 1
C) All rim conditions are 1
D) All of the above

Answer 1

All of the above

Question 2

An optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to the number of

A) Rows or columns
B) Rows & columns
C) Rows + columns - 1
D) None of the above

Answer 2

None of the above

Question 3

While solving an assignment problem, an activity is assigned to a resource through a square with zero opportunity cost because the objective is to

A) Minimize total cost of assignment
B) Reduce the cost of assignment to zero
C) Reduce the cost of that particular assignment to zero
D) All of the above

Answer 3

Minimize total cost of assignment

Question 4

The method used for solving an assignment problem is called

A) Reduced matrix method
B) MODI method
C) Hungarian method
D) None of the above

Question 5

The purpose of a dummy row or column in an assignment problem is to

A) Obtain balance between total activities & total resources
B) Prevent a solution from becoming degenerate
C) Provide a means of representing a dummy problem
D) None of the above

Question 6

Maximization assignment problem is transformed into a minimization problem by

A) Adding each entry in a column from the maximization value in that column
B) Subtracting each entry in a column from the maximum value in that column
C) Subtracting each entry in the table from the maximum value in that table
D) Any one of the above

Question 7

If there were n workers & n jobs there would be

A) n! solutions
B) (n-1)! solutions
C) (n!)n solutions
D) n solutions

Question 8

An assignment problem can be solved by

A) Simplex method
B) Transportation method
C) Both a & b
D) None of the above

Question 9

For a salesman who has to visit n cities which of the following are the ways of his tour plan

A) n!
B) (n+1)!
C) (n-1)!
D) n

Question 10

The assignment problem

A) Requires that only one activity be assigned to each resource
B) Is a special case of transportation problem
C) Can be used to maximize resources
D) All of the above

Question 11

An assignment problem is a special case of transportation problem, where

A) Number of rows equals number of columns
B) All rim conditions are 1
C) Values of each decision variable is either 0 or 1
D) All of the above

Question 12

Every basic feasible solution of a general assignment problem, having a square pay-off matrix of order, n should have assignments equal to

A) 2n+1
B) 2n-1
C) m+n-1
D) m+n

Question 13

To proceed with the MODI algorithm for solving an assignment problem, the number of dummy allocations need to be added are

A) n
B) 2n
C) n-1
D) 2n-1

Question 14

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 LP problem
D) Both a & b

Question 15

An optimal solution of an assignment problem can be obtained only if

A) Each row & column has only one zero element
B) Each row & column has at least one zero element
C) The data is arrangement in a square matrix
D) None of the above

Question 16

Customer behavior in which the customer moves from one queue to another in a multiple channel situation is

A) Balking
B) Reneging
C) Jockeying
D) Altering

Question 17

Which of the following characteristics apply to queuing system

A) Customer population
B) Arrival process
C) Both a & b
D) Neither a nor b

Question 18

Which of the following is not a key operating characteristics apply to queuing system

A) Utilization factor
B) Percent idle time
C) Average time spent waiting in the system & queue
D) None of the above

Question 19

Priority queue discipline may be classified as

A) Finite or infinite
B) Limited & unlimited
C) Pre-emptive or non-pre-emptive
D) All of the above

Question 20

The calling population is assumed to be infinite when

A) Arrivals are independent of each other
B) Capacity of the system is infinite
C) Service rate is faster than arrival rate
D) All of the above