Wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

QTM Sequencing and Queuing theory

Total questions: 25

Worksheet time: 13mins

Name
Class
Date
1.
Conditions under which 3 machines can be converted to 2 machines case is
a)
Min A>= Max B or min C>=max B
b)
Min A<= Max B or min C>=max B
c)
Min A> Max B or min C>max B
d)
none of the above
2.
In a 2 jobs and ‘n’ machine problem, the elapsed time for job 1 is calculated as (Job 1 is represented on X -axis)
a)
Process time for Job 1 + Total length of vertical line on graph.
b)
Process time for Job 2 + Idle time for Job 1
c)
Process time for job 1 + Total length of horizontal line on graph
d)
Process time for job 2 – Idle time for job 1
3.

In a 2 job and n machine sequencing problem, the vertical line on the graph indicates:

a)
Processing time of Job 1
b)
Processing time of Job 2
c)
Idle time of Job 2
d)
Idle time of both jobs
4.
In a 2 job and ‘n’ machine sequencing problem we find that:
a)
Sum of processing time of both the jobs is same
b)
Sum of idle time of both the jobs is same
c)
Sum of processing time and idle time of both the jobs is same
d)
Sum of processing time and idle time of both the jobs is different
5.

What is the definition of 'Processing Order'?

a)

The sequence in which tasks are executed on different machines

b)

The sequence in which tasks are executed on the first machine

c)

The sequence in which tasks are executed on the last machine

d)

The sequence in which machines are executed on different tasks

6.
3. Idle time is defined as
a)
The time for which a machine remains idle before completion of first job
b)
The time for which a machine remains idle before completion of all job
c)
The time for which a machine remains idle before completion of last job
d)
None of the above
7.
The time between starting job and completion of last job, if any is called:
a)
Total elapsed time
b)
Total idle time
c)
Both of the above
d)
None of the above
8.
No Passing Rule states that
a)
Same order of execution of jobs to be maintained on first machine
b)
Same order of execution of jobs is to be maintained on last machine
c)
Same order of execution of jobs is to be maintained on each machine
d)
None of the above
9.
The order in which the members of the queue are selected for service is known as
a)
FIFO
b)
Queue discipline
c)
LIFO
d)
SIRO
e)
10.
The degree to which the capacity of the service station is utilized is determined by the
a)
Arrival pattern
b)
Service mechanism
c)
Traffic intensity
d)
Queue discipline
11.
In certain application, when some customers are served before others regardless of their arrival i.e., giving priority over others is known as
a)
Jockeying
b)
Priority Service
c)
Balking
d)
Reneging
12.
When there are two or more parallel queues and the customer moves from one queue to another is called as
a)
Jockeying
b)
Priority Service
c)
Balking
d)
Reneging
13.
The acronym for SIRO stands for
a)
Service in Regular Order
b)
Service in Rational Order
c)
Service in Random Order
d)
none of the above
14.
If the customer enters a queue but decides to leave before being served, this behavior is known as
a)
Jockeying
b)
Priority Service
c)
Balking
d)
Reneging
15.
Queuing theory is also termed as ............................
a)
Game theory
b)
Replacement theory
c)
Waiting line theory
d)
none of the above
16.
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
17.

The relation 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
18.
Commonly assumed probability distribution of arrival pattern is .......................
a)
Poisson Distribution
b)
Ergland Distribution
c)
Exponential distribution
d)
None of the above
19.
Commonly assumed probability distribution of service pattern is .......................
a)
Poisson Distribution
b)
Binomial distribution
c)
Ergland Distribution
d)
Exponential distribution
e)
None of the above
20.
Arrivals at a telephone both are considered to be Poisson at an average time of 8 min between our arrival and the next. The length of the phone call is distributed exponentially, with a mean of 4 min. What is arrival rate
a)

7.5 customer/hour

b)

15 customer/hour

c)

10 customer/hour

d)
none of the above
21.
Arrivals at a telephone both are considered to be Poisson at an average time of 8 min between our arrival and the next. The length of the phone call is distributed exponentially, with a mean of 4 min. What is service rate
a)

7.5 customer/hour

b)

15customer/hour

c)

10 customer/hour

d)
none of the above
22.

In the context of the M/M/1:∞/FIFO queue model, which of the following statements is true?

A) The arrival process follows a deterministic distribution.
B) There is only one server.
C) The service rate is always greater than the arrival rate.
D) The queue discipline is Last-In-First-Out (LIFO).

a)

Only A is true.

b)

Only B is true.

c)

Both B and C are true.

d)
none of the above
23.

Which of the following statements accurately describes the M/M/1:∞/FIFO queuing model?

a)

The system has a single server, exponential service times, and a finite number of customers

b)

The system has multiple servers, exponential interarrival and service times, and an infinite queue capacity.

c)

The system has a single server, exponential interarrival and service times, infinite queue capacity, and customers are served on a first-come, first-served basis.

d)

The system has a single server, deterministic interarrival times, and a finite queue capacity.

24.

In the M/M/1:∞/FIFO queuing model, the arrival rate (λ) and service rate (μ) are given. What is the formula to calculate the utilization factor (ρ) of the system?

a)

ρ = λ / μ

b)

ρ = μ / λ

c)

ρ = μ / λ

d)

ρ = (λ + μ) / 2

25.
Which of the following relationship is not true
a)
𝑳𝒔=𝝀𝑾𝒔
b)
𝑳𝒔=𝑳𝒒+𝟏/𝝀
c)
𝑳𝒒=𝝀𝑾𝒒
d)

none of these