PROBLEM PAPER2 06
Number of timeslots : 100
Number of shifts    : 15
Number of employees : 15
Number of tasktypes : 5
Number of skills    : 15
Number of tasks     : 47
Number of locations : 1

SOLUTION
  1: Task #21(2) Task #22(96) 
  2: Task #31(2) Task #32(54) 
  3: Task #18(3) Task #19(14) Task #20(56) 
  4: Task #33(3) Task #34(50) Task #35(83) 
  5: Task #4(1) Task #5(16) 
  6: Task #36(2) Task #37(37) Task #38(62) 
  7: Task #39(2) Task #40(18) 
  8: Task #6(1) Task #7(7) Task #8(36) Task #9(58) 
  9: Task #14(4) Task #15(16) Task #16(50) Task #17(70) 
 10: Task #23(2) Task #24(8) Task #25(29) Task #26(82) 
 11: Task #46(2) Task #47(57) 
 12: Task #10(1) Task #11(19) Task #12(35) Task #13(72) 
 13: Task #27(3) Task #28(52) Task #29(82) Task #30(90) 
 14: Task #1(3) Task #2(51) Task #3(96) 
 15: Task #41(2) Task #42(11) Task #43(24) Task #44(25) Task #45(95) 

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

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