Task
|
Time (sec.)
|
Immediate Predecessor
|
A
|
30
|
-
|
B
|
20
|
A
|
C
|
35
|
A
|
D
|
30
|
B
|
E
|
45
|
B
|
F
|
55
|
C,D
|
G
|
35
|
D,E
|
H
|
20
|
F,G
|
a. Determine the minimum, maximum, and calculated cycle time.
b. What is the minimum number of stations needed?
c. Draw the precedence diagram.
d. Assign tasks to stations using this rule: assign tasks according to greatest number of following tasks. In case of a tie, use the tiebreaker of assigning task with the longest processing time first. (6 pts)
e. Calculate the efficiency of the system.
Problem 2:
Following data is given:
Weekly demand (d) = 140 units/week
Ordering costs (S) = $20/order
Holding costs (H) = $1/unit/year
Lead time = 6 weeks
Number of weeks per year = 52 weeks
Suppose the firm uses the EOQ to control the inventory, answer following questions:
a. Determine EOQ? (round it to the nearest integer number)
b. Find the length of an order cycle (in weeks)? (round it to the nearest integer number)
c. If you use EOQ as order quantity, what would be the total costs?
d. Find the reorder point (ROP)
