|
Question 1184856: Hi, I hope you're fine :> Can you help me?
You are the manager of a restaurant and you want to optimize as well as maximize the working capacity of four of your employees. Baratie has 45 tables and each table seats 4 people. You have observed the average time (in minutes) each of your employees take to set a table as as the average time each take to fold the four napkins in the table which you have tabulated.
EMPLOYEE AVERAGE TIME TO SET A TABLE
Patty 5
Carne 7
Sanji 4
Luffy 3
EMPLOYEE AVERAGE TIME TO FOLD 4 NAPKINS
Patty 4
Carne 3
Sanji 2
Luffy 5
Situation: If all your employees start working at the same time( which means that if an employee is done, he should help another employee), how quickly can all the tables be set? How about all the napkins be folded?
Answer by JBnovelwriter(34) (Show Source):
You can put this solution on YOUR website! EMPLOYEE AVERAGE TIME TO SET A TABLE
Patty 5(45)=225 mins
Carne 7(45)=315 mins
Sanji 4(45)=180 mins
Luffy 3(45)=135 mins
11.25 is the equal split of tables for 4 employees multiply by the average time for all 4 employees to complete 1 table(4.75)= 53.4375 mins
let's see if that's accurate.
p=53.4375/5=10.6875
c=53.4375/7=7.6339
s=53.4375/4=13.3593
l=53.4375/3=17.8125
thats 49.4932 tables so its less
lets do 50
10
7.1428
12.5
16.6667
hmm 46.3094 tables
still less than 50 mins
id go with about 49-50 mins
EMPLOYEE AVERAGE TIME TO FOLD 4 NAPKINS 4(45)=180 napkins
Patty 4/4= 1 min per napkin (180)=180 mins
Carne 3/4= 0.75 mins per napkin (180)=135 mins
Sanji 2/4= 0.5 mins per napkin (180)=90 mins
Luffy 5/4= 1.25 mins per napkin (180)=225 mins
so in ten mins time 10 divided by x mins per napkin
P=10
C=13.3333
S=20
L=8
total of 51.3333
so in 35 mins time 35 divided by x mins per napkin
P=35
C=46.6666
S=70
L=28
total of 179.66 napkins completed in 35mins so its likely just over 35mins to complete the napkins
I have to say the teacher that gave you this problem made this more difficult than necessary. even in a perfect world, this would never happen.
this was def a guess n check problem.
|
|
|
| |