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?
Option 1
Low Cost Option
Download this past answer in few clicks
2.88 USD
PURCHASE SOLUTION
Option 2
Custom new solution created by our subject matter experts
GET A QUOTE
rated 5 stars
Purchased 3 times
