QTM Sequencing and Queuing theory

Conditions under which 3 machines can be converted to 2 machines case is

• Min A>= Max B or min C>=max B
• Min A<= Max B or min C>=max B
• Min A> Max B or min C>max B
• none of the above

In a 2 jobs and ‘n’ machine problem, the elapsed time for job 1 is calculated as (Job 1 is represented on X -axis)

• Process time for Job 1 + Total length of vertical line on graph.
• Process time for Job 2 + Idle time for Job 1
• Process time for job 1 + Total length of horizontal line on graph
• Process time for job 2 – Idle time for job 1

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

• Processing time of Job 1
• Processing time of Job 2
• Idle time of Job 2
• Idle time of both jobs

In a 2 job and ‘n’ machine sequencing problem we find that:

• Sum of processing time of both the jobs is same
• Sum of idle time of both the jobs is same
• Sum of processing time and idle time of both the jobs is same
• Sum of processing time and idle time of both the jobs is different

What is the definition of 'Processing Order'?

• The sequence in which tasks are executed on different machines

• The sequence in which tasks are executed on the first machine

• The sequence in which tasks are executed on the last machine

• The sequence in which machines are executed on different tasks

3. Idle time is defined as

• The time for which a machine remains idle before completion of first job
• The time for which a machine remains idle before completion of all job
• The time for which a machine remains idle before completion of last job
• None of the above

The time between starting job and completion of last job, if any is called:

• Total elapsed time
• Total idle time
• Both of the above
• None of the above

No Passing Rule states that

• Same order of execution of jobs to be maintained on first machine
• Same order of execution of jobs is to be maintained on last machine
• Same order of execution of jobs is to be maintained on each machine
• None of the above

The order in which the members of the queue are selected for service is known as

• FIFO
• Queue discipline
• LIFO
• SIRO

The degree to which the capacity of the service station is utilized is determined by the

• Arrival pattern
• Service mechanism
• Traffic intensity
• Queue discipline