WorksheetsMCQ- SLIP TEST
Total questions: 10
Worksheet time: 5mins
No machine can process more than --------------- operation at a time.
One
Two
Three
Four
The time required to transfer the jobs between machines is -----------------.
High
Low
Moderate
Negligible
In a sequencing problem, --------------- rule is mentioned
Johnson
Time
No passing rule
Job changing
In a sequencing problem the total elapsed time should be-----------------.
Maximum
Negligible
Minimum
Not be defined
In sequencing problem, the order of completion of jobs is called
completion sequence
job sequence
processing order
job order
Forward pass calculations are done to find occurrence times of events.
exact
earliest
latest
approximate
The second longest path in the network diagram is called path.
alternate
feasible
sub-critical
critical
The shortest possible completion time of an activity in PERT is called time.
pessimistic
optimistic
most likely
expected
Floats for critical activities will be always.
one
zero
highest
same as duration of the activity
Which algorithm is used in sequencing problem to optimize the total elapsed time?.
Job
Machine
Optimization
Johnson
