PROBLEM PAPER2 05
Number of timeslots : 15
Number of shifts    : 15
Number of employees : 15
Number of tasktypes : 15
Number of skills    : 30
Number of tasks     : 43
Number of locations : 1

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

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

ASP SOLUTION
     Shift# 01 02 03 04 05 06 07 08 09 10 11 12 13 14 15 
  Shifts ok 07 13 08 14 10 08 15 01 15 01 10 15 14 08 07 
Emp#001  09 1  1  0  0  1  0  1  1* 1  0  1  1  0  0  1  
Emp#002  09 0  1  1  1  0  1* 1  0  1  0  0  1  1  1  0  
Emp#003  11 1  1  1  1  0  1  1  0  1  0  0  1  1* 1  1  
Emp#004  07 0  1  0  1  0  0  1  0  1  1* 0  1  1  0  0  
Emp#005  08 0  1  0  1* 1  0  1  0  1  0  1  1  1  0  0  
Emp#006  13 1  1  1  1  1  1  1  0  1  0  1  1  1  1* 1  
Emp#007  08 0  0  1  1  0  1  1* 0  1  0  0  1  1  1  0  
Emp#008  10 1  1  0  1  1  0  1  0  1  0  1* 1  1  0  1  
Emp#009  10 1  1  0  1  1  0  1  0  1  0  1  1* 1  0  1  
Emp#010  08 0  0  1  1  0  1  1  0  1* 0  0  1  1  1  0  
Emp#011  11 0  1  1  1  1* 1  1  0  1  0  1  1  1  1  0  
Emp#012  11 0  1  1* 1  1  1  1  0  1  0  1  1  1  1  0  
Emp#013  10 1* 1  0  1  1  0  1  0  1  0  1  1  1  0  1  
Emp#014  13 1  1  1  1  1  1  1  0  1  0  1  1  1  1  1* 
Emp#015  08 0  1* 0  1  1  0  1  0  1  0  1  1  1  0  0