# 1. The sequence of decisions that affect scheduling is A)

1. The sequence of decisions that affect scheduling is
A) Short-term ? intermediate term ? long term
B) Capacity planning ? aggregate planning ? master schedule ? short-term schedules
C) Strategic decisions ? tactical decisions ? operational decisions
D) Forward decisions ? current decisions ? backward decisions
E) None of the above
2. The jobs listed below needed to be completed. Assume that it is now day 140. If the jobs are sequenced according to shortest processing time rule, what is the average completion time?
Job
Processing Time (days)
Job due date (days)

A
20
180

B
30
200

C
10
175

D
16
230

E
18
210

A) 47.6 days
B) 60.2 days
C) 94.0 days
D) 2.5 days
E) 238.0 days
3. Five jobs are waiting to be processed. Their processing times and due dates are given below. Using the earliest due date dispatching rule, in which order should the jobs be processed?
Job
Processing Time (days)
Job due date (days)

A
4
7

B
2
4

C
8
11

D
3
5

E
5
8

A) C, E, A, D, B
B) A, B, C, D, E
C) B, D, A, E, C
D) C, B, A, E, D
E) None of the above
4. If job 5 takes 3, 4, or 5 hours to be completed by workers A, B, and C, respectively, what would the row values for job 5 be after performing Step 1A of the assignment method?
A) 3, 4, 5
B) 8, 9, 10
C) 0, 1, 2
D) 6, 7, 8
E) 1, 4/3, 5/3
5. Five jobs are waiting for processing through two work centers. Their processing time (in minutes) at each work center is contained in the table below. Each job requires work center Sigma before work center Delta. According to Johnson's rule, what sequence of jobs will minimize the completion time for all jobs?
Job
Sigma
Delta

R
40
10

S
25
30

T
50
20

U
35
35

V
55
15

A) R-S-T-U-V
B) S-V-T-R-U
C) S-U-T-V-R
D) V-R-U-S-T
E) None of the above
6. Which of the following statements regarding finite capacity scheduling (FCS) is false?
A) Finite capacity scheduling is well suited for dynamic scheduling environments.
B) Finite capacity scheduling overcomes the disadvantages of systems based exclusively on rules.
C) Finite capacity scheduling is very powerful, but does not allow for rapid changes.
D) Finite capacity scheduling often gets its data from the output of an MRP system.
E) None; all of the above are true.

0 replies