Solver Version v0.6
Started at: Nov. 24, 2016, 6:37 p.m. UTC
Current State: Solver Done
Score: 1036800
Solution: Optimal Solution Found
Options:
Arrive Late Bonus: 310
Leave Early Bonus: 320
Day Off Bonus: 500
No Break Penalty: {0: 660, 60: 0, 240: 0, 300: 200, 330: 400, 360: 800, 420: 1600, 480: 3200, 540: 6400, 600: 12800, 660: 25600}
Pupil Preference Penalties: 100,201,403,807
Instructor Preference Penalties: 305,620,1290,2600
Complex Constraints: 30min M 11:30-13:30 OR 30min M 11:30-13:30,30min M 11:30-13:30 OR 30min M 11:30-13:30,30min M 11:30-13:30 OR 30min M 11:30-13:30
Scheduler Output:
Solving with a time limit of 60 seconds of not improving the solution or a total time limit of 600 seconds
* #variable= 200 #constraint= 47 #product= 125 sizeproduct= 8
Penalty 0 for term "arrive late" (0 + 0)
Penalty -76800 for term "leave early" (-76800 + 0)
Penalty -960000 for term "day off" (-960000 + 0)
Penalty 0 for term "no break" (0 + 0)
Penalty 0 for term "instructor preference" (0 + 0)
Penalty 0 for term "pupil preference" (0 + 0)
Total Penalty -1036800 for term "pupil preference" (-1036800 + 0)
Optimizer Output:
c clasp version 3.1.0
c Reading from /tmp/tmp0h3l65l3
c Solving...
o -769200
o -773400
o -855600
o -856200
o -856800
o -925800
o -945000
o -946800
o -960000
o -978600
o -979200
o -1017600
o -1036200
o -1036800
c Answer: 14
v -x1 -x2 -x3 -x4 -x5 -x6 -x7 -x8 -x9 -x10 -x11 -x12 -x13 -x14 -x15 -x16
v x17 x18 x19 x20 -x21 -x22 -x23 -x24 -x25 -x26 -x27 -x28 -x29 -x30 -x31
v -x32 -x33 -x34 -x35 -x36 -x37 -x38 -x39 -x40 -x41 -x42 -x43 -x44 -x45 -x46
v -x47 -x48 -x49 -x50 -x51 -x52 -x53 -x54 -x55 -x56 -x57 x58 -x59 -x60 -x61
v -x62 -x63 -x64 -x65 -x66 -x67 -x68 -x69 -x70 -x71 -x72 -x73 -x74 -x75 -x76
v -x77 -x78 -x79 -x80 -x81 -x82 -x83 -x84 -x85 -x86 -x87 -x88 -x89 -x90 -x91
v -x92 -x93 -x94 -x95 -x96 x97 -x98 -x99 -x100 -x101 -x102 -x103 -x104 -x105
v -x106 -x107 -x108 -x109 -x110 -x111 -x112 -x113 -x114 -x115 -x116 -x117
v -x118 -x119 -x120 -x121 -x122 -x123 -x124 -x125 -x126 -x127 -x128 -x129
v -x130 -x131 -x132 -x133 -x134 -x135 -x136 -x137 -x138 -x139 x140 -x141
v -x142 -x143 -x144 -x145 -x146 -x147 -x148 -x149 -x150 -x151 -x152 -x153
v -x154 -x155 -x156 -x157 -x158 -x159 -x160 -x161 -x162 -x163 -x164 -x165
v -x166 -x167 -x168 -x169 -x170 -x171 -x172 -x173 -x174 -x175 -x176 -x177
v -x178 x179 -x180 -x181 -x182 -x183 -x184 -x185 -x186 -x187 -x188 -x189
v -x190 -x191 -x192 -x193 -x194 -x195 -x196 -x197 -x198 -x199 -x200
s OPTIMUM FOUND
c
c Models : 14
c Optimum : yes
c Optimization : -1036800
c Calls : 1
c Time : 9.556s (Solving: 9.56s 1st Model: 0.00s Unsat: 7.91s)
c CPU Time : 9.400s
c Threads : 8 (Winner: 5)
Created at: Nov. 24, 2016, 6:37 p.m. UTC
score: 1036800
Pupil Session Times. Pupil Name -- W8:00 Pupil Name -- W7:00 Pupil Name -- W10:00 Pupil Name -- W9:00 Instructor Schedule. For reference the first column is the instructor preference value (i1, i2, i3, etc). The second column is the pupil preference value (p1, p2, p3, etc). The third column is the session time. And the fourth column is the pupil name. i1 M7:00 i1 M8:00 i1 M9:00 i1 M10:00 i1 M11:00 i1 M12:00 i1 M13:00 i1 M14:00 i1 T7:00 i1 T8:00 i1 T9:00 i1 T10:00 i1 T11:00 i1 T12:00 i1 T13:00 i1 T14:00 i1 p1 W7:00 Pupil Name i1 p1 W8:00 Pupil Name i1 p1 W9:00 Pupil Name i1 p1 W10:00 Pupil Name i1 W11:00 i1 W12:00 i1 W13:00 i1 W14:00 i1 R7:00 i1 R8:00 i1 R9:00 i1 R10:00 i1 R11:00 i1 R12:00 i1 R13:00 i1 R14:00 i1 F7:00 i1 F8:00 i1 F9:00 i1 F10:00 i1 F11:00 i1 F12:00 i1 F13:00 i1 F14:00