PROBLEM PAPER2 04
Number of timeslots : 30
Number of shifts    : 10
Number of employees : 10
Number of tasktypes : 10
Number of skills    : 10
Number of tasks     : 72
Number of locations : 19

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

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

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