PROBLEM PAPER2 03
Number of timeslots : 30
Number of shifts    : 10
Number of employees : 10
Number of tasktypes : 10
Number of skills    : 10
Number of tasks     : 88
Number of locations : 1

SOLUTION
  1: Task #68(1) Task #51(2) Task #20(4) Task #31(8) Task #55(10) Task #24(16) Task #9(19) Task #18(20) Task #78(29) Task #13(30) 
  2: Task #59(3) Task #80(4) Task #81(9) 
  3: Task #1(4) Task #33(10) Task #23(12) Task #73(16) Task #8(18) Task #25(20) Task #67(27) Task #14(29) 
  4: Task #82(3) Task #69(6) Task #32(7) Task #54(8) Task #72(9) Task #4(15) Task #47(17) Task #77(21) Task #87(26) 
  5: Task #28(3) Task #43(5) Task #21(7) Task #45(9) Task #46(15) Task #74(17) Task #17(20) Task #39(22) Task #49(25) Task #41(29) 
  6: Task #42(4) Task #53(5) Task #44(7) Task #22(9) Task #6(13) Task #64(15) Task #65(18) Task #48(20) Task #11(23) Task #12(27) Task #50(28) 
  7: Task #19(1) Task #79(3) Task #29(4) Task #52(5) Task #71(7) Task #30(9) Task #3(10) Task #2(11) Task #35(12) Task #5(14) Task #34(15) Task #84(16) Task #85(19) Task #10(21) Task #86(23) Task #57(25) 
  8: Task #15(1) Task #83(5) Task #36(16) Task #56(17) Task #88(26) 
  9: Task #58(2) Task #60(3) Task #61(4) Task #16(7) Task #76(22) Task #40(23) 
 10: Task #26(1) Task #27(2) Task #70(4) Task #62(7) Task #63(10) Task #37(16) Task #7(17) Task #38(18) Task #75(20) Task #66(22) 

COST
  Feasible violations = 0
  Number of feasible pairs = 15 (15)

ASP SOLUTION
     Shift# 01 02 03 04 05 06 07 08 09 10 
  Shifts ok 02 02 02 01 01 03 01 01 01 01 
Emp#001  01 1* 0  0  0  0  0  0  0  0  0  
Emp#002  01 0  0  0  1* 0  0  0  0  0  0  
Emp#003  02 0  1* 0  0  0  1  0  0  0  0  
Emp#004  02 1  0  0  0  0  0  1* 0  0  0  
Emp#005  01 0  0  0  0  0  0  0  0  1* 0  
Emp#006  02 0  1  0  0  1* 0  0  0  0  0  
Emp#007  01 0  0  0  0  0  0  0  0  0  1* 
Emp#008  01 0  0  0  0  0  0  0  1* 0  0  
Emp#009  02 0  0  1* 0  0  1  0  0  0  0  
Emp#010  02 0  0  1  0  0  1* 0  0  0  0