PROBLEM PAPER2 01
Number of timeslots : 10
Number of shifts    : 10
Number of employees : 10
Number of tasktypes : 10
Number of skills    : 30
Number of tasks     : 48
Number of locations : 1

SOLUTION
  1: Task #31(1) Task #39(6) Task #16(8) 
  2: Task #35(1) Task #11(2) Task #21(3) Task #33(4) Task #14(6) Task #15(7) 
  3: Task #1(1) Task #45(4) Task #46(5) Task #44(6) Task #3(7) 
  4: Task #9(1) Task #27(2) Task #38(4) Task #32(6) 
  5: Task #6(1) Task #23(4) Task #18(7) 
  6: Task #19(1) Task #17(2) Task #8(8) 
  7: Task #22(1) Task #5(2) Task #12(4) Task #13(5) Task #47(6) Task #7(7) Task #40(8) Task #41(9) 
  8: Task #4(1) Task #20(2) Task #34(3) 
  9: Task #26(1) Task #10(2) Task #37(3) Task #28(4) Task #29(5) Task #30(6) Task #24(8) Task #25(10) 
 10: Task #42(1) Task #43(2) Task #36(3) Task #2(4) Task #48(7) 

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

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