PROBLEM PAPER2 07 Number of timeslots : 48 Number of shifts : 15 Number of employees : 15 Number of tasktypes : 20 Number of skills : 20 Number of tasks : 139 Number of locations : 19 SOLUTION 1: Task #83(2) Task #80(14) Task #21(33) Task #112(35) Task #25(38) 2: Task #46(5) Task #72(9) Task #85(21) Task #87(41) 3: Task #44(1) Task #137(28) Task #76(36) Task #56(38) Task #55(41) Task #67(43) 4: Task #93(3) Task #101(21) Task #105(22) Task #95(25) Task #96(32) Task #97(35) Task #38(47) 5: Task #68(1) Task #79(5) Task #84(14) Task #126(18) Task #51(19) Task #128(23) Task #10(28) Task #81(32) 6: Task #122(3) Task #88(4) Task #49(10) Task #61(12) Task #63(27) Task #110(32) Task #41(34) Task #42(35) Task #14(36) Task #66(38) Task #57(45) 7: Task #136(2) Task #130(10) Task #26(14) Task #50(16) Task #73(20) Task #74(29) Task #75(35) Task #12(37) Task #9(39) Task #62(41) Task #108(43) 8: Task #69(2) Task #4(7) Task #89(11) Task #22(22) Task #23(24) Task #127(28) Task #3(32) Task #131(36) Task #133(39) Task #132(41) Task #134(42) Task #58(46) 9: Task #135(1) Task #116(2) Task #117(8) Task #106(25) Task #107(26) Task #39(28) Task #11(30) Task #109(34) Task #111(36) Task #37(37) Task #43(39) Task #13(41) Task #113(43) 10: Task #123(2) Task #27(9) Task #28(10) Task #29(12) Task #129(13) Task #138(16) Task #139(41) 11: Task #24(7) Task #90(21) Task #91(25) Task #92(36) 12: Task #98(5) Task #6(16) Task #7(21) Task #8(23) Task #45(28) 13: Task #78(3) Task #82(6) Task #19(7) Task #20(18) Task #118(19) Task #40(25) Task #54(30) Task #15(38) Task #16(41) Task #18(47) 14: Task #121(3) Task #48(9) Task #5(14) Task #124(16) Task #125(17) Task #32(18) Task #33(20) Task #34(21) Task #35(22) Task #36(23) Task #94(26) Task #119(30) Task #120(32) 15: Task #1(1) Task #31(7) Task #59(9) Task #2(11) Task #30(12) Task #103(13) Task #71(14) Task #47(15) Task #99(16) Task #100(17) Task #60(18) Task #102(19) Task #70(20) Task #52(22) Task #53(25) Task #86(29) Task #104(30) Task #64(31) Task #65(34) Task #77(36) Task #17(40) Task #114(42) Task #115(43) COST Feasible violations = 0 Number of feasible pairs = 108 (110) ASP SOLUTION Shift# 01 02 03 04 05 06 07 08 09 10 11 12 13 14 15 Shifts ok 10 11 03 09 06 11 10 04 05 09 05 08 07 09 01 Emp#001 11 1 1 0 1 1 1 1 0 1 1 0 1* 1 1 0 Emp#002 08 1 1 0 1 0 1 1 0 0 1 0 1 0 0 1* Emp#003 05 1 1 1 1* 0 0 0 0 0 1 0 0 0 0 0 Emp#004 08 1* 1 0 0 1 1 1 0 0 0 0 1 1 1 0 Emp#005 11 1 1 0 1 0 1 1 1 0 1 1 1 1* 1 0 Emp#006 07 1 0 0 1 0 1 1 1* 0 0 0 0 1 1 0 Emp#007 01 0 1* 0 0 0 0 0 0 0 0 0 0 0 0 0 Emp#008 01 0 0 0 0 0 0 0 0 0 0 1* 0 0 0 0 Emp#009 13 1 1 0 1 1* 1 1 1 1 1 1 1 1 1 0 Emp#010 09 1 1 1 0 1 1 1 0 1* 1 0 0 0 1 0 Emp#011 11 1 1 0 1 1 1 1 0 1 1 0 1 1 1* 0 Emp#012 05 0 1 0 1 0 1* 0 0 0 0 1 1 0 0 0 Emp#013 03 0 0 0 0 0 1 1* 0 0 0 0 0 0 1 0 Emp#014 14 1 1 1* 1 1 1 1 1 1 1 1 1 1 1 0 Emp#015 01 0 0 0 0 0 0 0 0 0 1* 0 0 0 0 0