Consider a process consisting of three resources. Assume there exists unlimited demand for the product, and that all activities are always performed in the following sequence. Resource 1 has a processing time of 6 minutes per unit. Resource 2 has a processing time of 3 minutes per unit. Resource 3 has a processing time of 5 minutes per unit. All three resources are staffed by one worker and each worker gets paid $14 per hour. How much idle time does the worker at resource 3 have per unit?

At the beginning of each week, a machine is in one of four conditions: 1 = excellent; 2 = good; 3 = average; 4 = bad. The weekly revenue earned by a machine in state 1, 2, 3, or 4 is 100, 90, 50, or 10, respectively. After observing the condition of the machine at the beginning of the week, the company has the option, for a cost of 200, of instantaneously replacing the machine with an excellent machine. The quality of the machine deteriorates over time, as shown in the file P10 41.xlsx. Four maintenance policies are under consideration: Policy 1: Never replace a machine. Policy 2: Immediately replace a bad machine. Policy 3: Immediately replace a bad or average machine. Policy 4: Immediately replace a bad, average, or good machine. Simulate each of these policies for 50 weeks (using at least 250 iterations each) to determine the policy that maximizes expected weekly profit. Assume that the machine at the beginning of week 1 is excellent.