question archive The local university has developed an eight-step process for screening the thousands of admissions applications it gets each year
The local university has developed an eight-step process for screening the thousands of admissions applications it gets each year
Subject:EconomicsPrice:2.88 Bought3
The local university has developed an eight-step process for screening the thousands of admissions applications it gets each year. The provost has decided that the best way to take a first cut at all these applications is by employing a line process. The following table shows the times and predecessors for the various tasks:
| TASK | TIME (MINUTES) | IMMEDIATE PREDECESSOR |
|---|---|---|
| A | 1.2 | None |
| B | 1 | A |
| C | 0.65 | B |
| D | 1.1 | B |
| E | 1.3 | C |
| F | 0.7 | D |
| G | 0.8 | D |
| H | 0.9 | E,F,G |
In theory, what is the fastest cycle time possible given the tasks listed above? How many applications per hour does this translate into?
Purchase A New Answer
Custom new solution created by our subject matter experts
GET A QUOTE
Answer Preview
Fastest cycle time is the largest time which can be seen in the above table that is 1.3 at E. It is the maximum of all task.
Here,
Application per hour = APH
Available time = AT
Fastest cycle time = FCT
Application per hour
APH = AT / FCT
APH = 60 / 1.3
APH = 46.15
APH = 46
