Scheduling Part 1. Question 1. How many of the statements are true? (A) 0 (B) 1 (C) 2 (D) 3 (E) 4 Statement 1. The Johnson’s rule is a sequencing rule for an ‘nx1’ system. Statement 2. The total flow time is minimized in an ‘nx2’ system when the schedule is based on the MPT rule. Statement 3. The flow time for a job is equal to the processing time minus the queue time. Statement 4. The start date for a job is equal to the due date minus the processing time. Part 2. Questions 2-3 Five jobs arrived to be processed. Present Date= 180 Work Order A B C D E Processing Time (Days) 20 8 25 4 15 Due Date 211 200 224 210 205 Question 2. The FIFO schedule is “ABCDE” and the LIFO schedule is “EDCBA”. Consider the schedules based on the sequencing rules: Minimum Processing Time (MPT); Earliest Due Date (EDD); Minimum Slack Time (MST); and Minimum Critical Ratio (MCR). How many of the schedules are correct? (A) 0 (B) 1 (C) 2 (D) 3 (E) 4 The schedule based on the MPT sequencing rule is E,A,B,C,D The schedule based on the EDD sequencing rule is B,E,D,A,C The schedule based on the MST sequencing rule is D,B,E,A,C The schedule based on the MCR sequencing rule is A,E,C,B,D Question 3. What is the flow of the MPT schedule? (A) 162 (B) 230 (C) 72 (D) 233 (E) none of the above Part 3. Questions 4-5 The jobs A,B,C,D,E, arrived in that order to be processed on two machines. Job A B C D E Time on Machine 1 35 41 49 28 53 Time on Machine 2 32 56 36 48 55 Question 4. Which is the Johnson’s Rule schedule? (A) ‘CEBAD’ (B) ‘DBECA’ (C) ‘DCABE’ (D) ‘DABEC’ Question 5. How many of the statements are correct? (A) 0 (B) 1 (C) 2 (D) 3 (E) 4 Statement 1. In the FIFO schedule, the total time of completion is 271. Statement 2. In the FIFO schedule, the flow time of job D is 216. Statement 3. In the FIFO schedule, the total queue time of job C is 76. Statement 4. In the FIFO schedule, the total idle time of machine 2 is 35. Part 4. Questions 6-7 An organization that continuously processes proposals is addressing a large backlog due to an historical FIFO sequencing rule. You have been asked to determine a schedule that minimizes the processing time of project proposals through the editing department and revision department. The editing department identifies changes and the revision department incorporates the changes and produces a final proposal document for release. A proposal must pass through each department. Each department has personnel to service only one document at a time. The editing time is dependent on the type of proposal and the revision time is dependent on the size of the proposal. The time estimates below have been provided to you for scheduling. Question 6. What is the minimum processing time in minutes? (A) 525 (B) 1025 (C) 522 (D) 502 (E) none of the above Question 7. What is the minimum average jobs per minute that can be achieved.

1. Scheduling
Part 1. Question 1. How many of the statements are true?
(A) 0 (B) 1 (C) 2 (D) 3 (E) 4
Statement 1. The Johnson’s rule is a sequencing rule for an
‘nx1’ system.
Statement 2. The total flow time is minimized in an ‘nx2’
system when the schedule is based on the MPT rule.
Statement 3. The flow time for a job is equal to the processing
time minus the queue time.
Statement 4. The start date for a job is equal to the due date
minus the processing time.
Part 2. Questions 2-3
Five jobs arrived to be processed.
Present Date=
180
Work Order
A
B
C
D
E
Processing Time (Days)
20
8
25
4
15
Due Date
211
200

2. 224
210
205
Question 2. The FIFO schedule is “ABCDE” and the LIFO
schedule is “EDCBA”.
Consider the schedules based on the sequencing rules:
Minimum Processing Time (MPT); Earliest Due Date (EDD);
Minimum Slack Time (MST); and Minimum Critical Ratio
(MCR). How many of the schedules are correct?
(A) 0 (B) 1 (C) 2 (D) 3 (E) 4
The schedule based on the MPT sequencing rule is E,A,B,C,D
The schedule based on the EDD sequencing rule is B,E,D,A,C
The schedule based on the MST sequencing rule is D,B,E,A,C
The schedule based on the MCR sequencing rule is A,E,C,B,D
Question 3. What is the flow of the MPT schedule?
(A) 162 (B) 230 (C) 72 (D) 233 (E) none of the above
Part 3. Questions 4-5
The jobs A,B,C,D,E, arrived in that order to be processed on
two machines.
Job
A
B
C
D
E
Time on Machine 1
35
41
49
28
53

3. Time on Machine 2
32
56
36
48
55
Question 4. Which is the Johnson’s Rule schedule?
(A) ‘CEBAD’ (B) ‘DBECA’ (C) ‘DCABE’ (D)
‘DABEC’
Question 5. How many of the statements are correct?
(A) 0 (B) 1 (C) 2 (D) 3 (E) 4
Statement 1. In the FIFO schedule, the total time of completion
is 271.
Statement 2. In the FIFO schedule, the flow time of job D is
216.
Statement 3. In the FIFO schedule, the total queue time of job C
is 76.
Statement 4. In the FIFO schedule, the total idle time of
machine 2 is 35.
Part 4. Questions 6-7
An organization that continuously processes proposals is
addressing a large backlog due to an historical FIFO sequencing
rule. You have been asked to determine a schedule that
minimizes the processing time of project proposals through the
editing department and revision department. The editing

4. department identifies changes and the revision department
incorporates the changes and produces a final proposal
document for release. A proposal must pass through each
department. Each department has personnel to service only one
document at a time. The editing time is dependent on the type
of proposal and the revision time is dependent on the size of the
proposal. The time estimates below have been provided to you
for scheduling.
Question 6. What is the minimum processing time in minutes?
(A) 525 (B) 1025 (C) 522 (D) 502 (E) none of the
above
Question 7. What is the minimum average jobs per minute that
can be achieved?
(A) 281 (B) 21 (C) 41 (D) 13 (E) none of the above
Proposal #
Editing Time (minutes)
Revision Time (minutes)
1
17
18
2
24
26
3
18
17
4
13
15
5
24
23
6
28
26

5. 7
20
21
8
22
20
9
16
17
10
12
10
11
21
22
12
30
28
13
18
19
14
20
19
15
12
13
16
25
27
17
22
25
18
23
21

6. 19
17
16
20
26
29
21
14
16
22
19
18
23
29
27
24
16
15
25
26
25
Question 8. Which Gantt Chart is correct for the project
definition?
(A) Gantt Chart A
(B) Gantt Chart B
(C) Gantt Chart C

7. (D) Gantt Chart D
(E) None of the above
Project Definition
Gantt Chart A
Gantt Chart B
Activity
Predecessor
Activity
Time
1
2
3
4
1
2
3
4
1
---
1
2

8. 1
1
3
1,2
2
4
1
2

9. 5
2,4
1
Project Definition
Gantt Chart C
Gantt Chart D
Activity
Predecessor
Activity
Time
1
2
3
4
1
2
3
4
1

10. ---
1
2
1
1
3
1,2
2

11. 4
1
2
5
2,4
1
which indicates a stable system with the greatest average wait
time for a customer?

12. Question 10. Using the aggregate run-out method for the
assembly line schedule problem below, what is the production
for product C in hours?
(A) 3 (B) 4 (C) 6 (D) 28 (E) None of the above
Available production = 53 hours.
Product
Line
Production
Inventory
Demand
Products
Hours/Item
Items
Items/week
A
0.1
120
50
B
0.2
100
80
C
0.1
110
50
D
0.3
200
80
E

13. 0.2
90
40
>>>End of Homework<<<