Original Cost Minimization problem is $22,540

New Problem:

Staff Scheduling Decision Variables shift Number S1 S2 0 0 S3 S4 S5 S6 S7 staff 0 0 0 0 0 Objective Function Minimize cost Total 0.00 680 705 705 705 705 680 655 RHS Constraints SU LHS 0 18 Shifti Shift2 Shift3 Shift4 Shifts Shift Shift7 0 1 1 1 1 0 0 0 1 1 1 1 1 1 0 0 1 1 1 1 MO 0 27 TU 0 22 WE 1 1 0 0 1 1 1 0 26 TH 1 1 1 0 0 1 1 0 25 FR 1 1 1 1 0 0 1 0 21 SA 1 1 1 1 1 0 0 0 19 The company realizes that the optimal solution is a bit impractical as there is quite a bit of fluctuation on the number of agents who start their shift on a particular day. The company would like that to be more uniform and wants to minimize the largest number of shift workers who start on any given day. a. Formulate this is a mini-mix problem and find the optimal solution b. Is this a better solution than that obtained from the original (pure) cost minimization problem? Justify your answer based on solution quality and impact to cost./ 3 4 5 6 7 8 9 10 N Machine Job 1 2 3 4 1 7 3 4 1 2 LD 3 B 3 4 5 2. un 1 4 4 7 C st 1 2 3 5 3 6 5 1 N D 7 5 3 6 3 5 4 5 N 6 6 E 4 2 1 5 6 2 3 3 4 1 2 3 4 5 6 7 8 9 Machine Job 10 Run Time No. Jobs 0 0 B 0 0 C 0 0 D 0 0 0 0 E Completion 0 0 0 0 0 0 0 0 0 0 Max Time 0 TOTAL TIME Min the Max Time per machine 0 0 - 1 Max Time 0 >= 0 "" 1 0 >= O O O O 0" 1 0 >= 1 0 >= 0 "2" 0" 1 0 >= 0 1 0 "" 0" 1 0 "" 0 0 "-" 1 0 "" 1 0 "-" 1