$017$

$f_x$

$\backslash$table$[[,$A$,$B$,$c$,$D$,$E$,$F$,$G$,H,1,$J$],[2,,,,,,,,,,],[3,,$Time A$,$Time B$,$Time C$,$P$.$C$.$ A$,$P$.$C$.$ B$,$P$.$CC$,$S$.$C$.$ A$,$S$.$C$.$ B$,$s$.$c$.$ C$],[4,$Machine $1,0\mathrm{.}4,0\mathrm{.}11,0\mathrm{.}9,13,9,10,55,93,60],[5,$Machine $2,0\mathrm{.}5,1\mathrm{.}2,1\mathrm{.}3,11,12,8,65,58,75],[6,,,,,,,,,,],[7,,,,,,,,,,],[8,,,,,,,,,,],[9,,,,,,,,,,],[10,,,,,,,,,,],[11,,,,,,,$Production,Setup Costs E$,$Enabled,$],[12,$Up time $1,8,,,$Machine $1,,,,,],[13,$Up Time $2,6,,,,$A$,3,1,1,],[14,,,,,,$B$,7,1,1,],[15,$Total Time$1,1\mathrm{.}97,,,,$C$,0,0,0,],[16,$Total Time $2,5\mathrm{.}2,,,$Machine $2,,,,,],[17,cos,,,,,$A$,0,0,0,],[18,,$I,,,,B$,0,0,0,],[19,$Demand $A,3,,,,$C$,4,1,1,],[20,$Demand B$,7,,,,,,,,],[21,$Demand $C,4,,,,,11,,,],[22,,$t$,,,$Min cost,$357,,,,],[23,$Supply A$,3,,,,,,,,]]$

Supply B $,7$

Question $5$: $15$ points

The production team hired a summer intern to create a spreadsheet to understand what the optimal solution should be for assigning certain complex parts to possible machines. Unfortunately, the person creating it did not go d created a spreadsheet that is not easily understandable. Use the concepts, techniques and the "cardinal rules" you learned in Quantitative Problem Solving to fix the Question$5$ spreadsheet in your Excel file. $($Hint: Start with Solver and work backwards and you can assume the answer is incorrect.$)$