A JOB must go through an assembly line made up of four sequential operations. The next operation on a JOB cannot begin until the prior operation of that JOB is completed AND the JOB occupying the next operation is complete (moves on). Therefore, there are two scenarios for each operation: 1) an operation completes a JOB before the next operation is complete with it's JOB, then that JOB must wait in that station until the next operation is complete with its JOB, so that JOB is delayed. 2) if a JOB on one station completes after the JOB on the next operation has completed, it can move immediately to the next operation Finally, the first operation can start immediately as soon as it's station is clear of the job it is working on (there is a stack of incoming jobs already arrived). The time it takes to complete each operation is normally distributed with a mean of 12 minutes and a standard deviation of 2 minutes. Setup the experiment to run for an eight hour day. Simulate that day for 1000 replications and calculate a 95% confidence interval for the number of jobs completed in a day. Note: a "job" starts at station 1 and counts as complete when station 4 finishes. What are the longest and shortest days in your 1000 replications? Operation time (normally distributed) Mean 12 minutes Standard Deviation 2 minutes