Problem $13-16($Static$)$

A company produces two very similar products that go through a three$-$step sequence of fabrication, assembly, and packaging. Each step requires one day for a lot to be completely processed and moved to the next department. Processing requirements for the departments $($hours per unit$)$ are

$\backslash$table$[[,$FABRICATION,ASSEMBLY,PACKAGING,$],[$Product$,$Labor,Machine,Labor,Machine,Labor,Machine$],[$A$,2,1,1\mathrm{.}5,1,1,\mathrm{.}5],[$B$,1,1,1,1,1\mathrm{.}5,\mathrm{.}5]]$

Department capacities are all $700$ hours of labor and $500$ hours of machine time, except Friday, when capacities are $200$ hours for both labor and machine time. The following production schedule is for next week:

$\backslash$table$[[,$Units scheduled to be produced,,,$],[$Product$,$Mon,Tues,Wed,Thurs,Fri$],[$A$,200,400,100,300,100],[$B$,300,200,200,200,200]]$

Click here for the Excel Data File

Develop a production schedule for each department that shows the capacity requirements for each product and the total load for each day. Ignore changeover time. Note: The Load of Labor and Machine may exceed the Capacity. $($Round your answers to the nearest whole number.$)$

Develop a production schedule for each department that shows the capacity requirements for each product and the total load for each day. Ignore changeover time. Note: The Load of Labor and Machine may exceed the Capacity. $($Round your answers to the nearest whole number.$)$

The numbers already inputted into the table are correct.