PROBLEM PAPER2 02
Number of timeslots : 20
Number of shifts    : 10
Number of employees : 10
Number of tasktypes : 5
Number of skills    : 20
Number of tasks     : 29
Number of locations : 1

SOLUTION
  1: Task #15(1) Task #16(5) Task #18(8) Task #7(16) 
  2: Task #4(2) Task #8(12) Task #24(17) 
  3: Task #10(2) Task #26(6) 
  4: Task #19(2) Task #20(13) 
  5: Task #6(4) Task #5(12) 
  6: Task #12(2) Task #17(5) Task #3(7) 
  7: Task #27(2) Task #28(3) Task #29(19) 
  8: Task #1(4) Task #13(5) Task #14(9) 
  9: Task #25(2) Task #11(6) 
 10: Task #2(3) Task #21(6) Task #22(9) Task #23(14) Task #9(19) 

COST
  Feasible violations = 0
  Number of feasible pairs = 24 (25)

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