combination optimization problem

Your are running a call-centre and need to assign employees for the next 6 shifts (i.e. one hour wor! period). For each of the next 6 hours here the number of calls coming-in, Hour 1 Hour 2 Hour 3 Hour 4 Hour 5 Hour 6 3000 4000 2000 5000 2000 1000 For simplicity we assume that all calls arrive at the start of a shift (i.e. at the start of hour 1, 2, 3, 4, 5, or 6). Employees are paid and hired for each shifts independently. Here is the cost of hiring one employee for different shifts, Hour 1 Hour 2 Hour 3 Hour 4 Hour 5 Hour 6 15$ 12$ 11$ 22$ 15$ 14$ The number of calls that one employee can process during a one hour time period is 34. The call- centre has to pay a penalty for not answering calls in a timely manner. More precisely, at the end of each shift, for each unprocessed call the call-centre will have to pay 0.1$. Your goal is to decide how many employees to hire during each time period, so that you minimize the cost of hiring the employees plus the penalty. Formulate this problem as an INTEGER PROGRAM