Solver Version v0.5
Started at: Aug. 30, 2015, 3:37 p.m. UTC
Current State: Solver Done
Score: 187200
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,30min T 11:30-13:30,30min W 11:30-13:30,30min R 11:30-13:30,30min F 11:30-13:30,30min S 11:30-13:30,30min U 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= 187 #constraint= 53 #product= 114 sizeproduct= 13
Penalty 0 for term "day off" (0 + 0)
Penalty 0 for term "instructor preference" (0 + 0)
Penalty -38400 for term "leave early" (-38400 + 0)
Penalty 0 for term "pupil preference" (0 + 0)
Penalty -148800 for term "arrive late" (-148800 + 0)
Penalty 0 for term "no break" (0 + 0)
Total Penalty -187200 for term "no break" (-187200 + 0)
Optimizer Output:
c clasp version 3.1.0
c Reading from /tmp/tmpfjse0x2c
c Solving...
o -64200
o -73500
o -82800
o -148200
o -167700
o -177300
o -183300
o -186300
o -186600
o -186900
o -187200
c Answer: 11
v -x1 -x2 x3 x4 x5 x6 x7 x8 x9 -x10 x11 x12 x13 x14 x15 -x16 -x17 -x18 -x19
v -x20 -x21 x22 x23 x24 x25 x26 x27 x28 -x29 -x30 x31 -x32 -x33 -x34 -x35
v -x36 -x37 -x38 -x39 -x40 -x41 -x42 -x43 -x44 -x45 -x46 -x47 x48 -x49 -x50
v -x51 -x52 -x53 -x54 -x55 -x56 -x57 -x58 x59 -x60 -x61 x62 -x63 -x64 -x65
v -x66 -x67 -x68 -x69 -x70 x71 -x72 -x73 -x74 -x75 x76 -x77 -x78 -x79 -x80
v -x81 -x82 -x83 -x84 x85 -x86 -x87 x88 -x89 -x90 -x91 -x92 -x93 -x94 x95
v -x96 -x97 -x98 -x99 -x100 -x101 -x102 -x103 -x104 -x105 -x106 -x107 -x108
v -x109 -x110 -x111 x112 -x113 -x114 -x115 -x116 -x117 x118 -x119 x120 -x121
v -x122 -x123 x124 -x125 -x126 -x127 -x128 -x129 -x130 -x131 -x132 -x133
v x134 -x135 -x136 -x137 -x138 -x139 -x140 -x141 -x142 -x143 -x144 -x145
v -x146 x147 -x148 -x149 -x150 -x151 -x152 -x153 -x154 -x155 -x156 -x157
v -x158 x159 -x160 -x161 -x162 -x163 -x164 -x165 x166 -x167 -x168 -x169 -x170
v -x171 -x172 -x173 -x174 -x175 x176 -x177 -x178 -x179 -x180 -x181 -x182
v -x183 -x184 -x185 -x186 x187
s OPTIMUM FOUND
c
c Models : 11
c Optimum : yes
c Optimization : -187200
c Calls : 1
c Time : 12.327s (Solving: 12.33s 1st Model: 0.00s Unsat: 12.28s)
c CPU Time : 12.200s
c Threads : 8 (Winner: 6)
Created at: Aug. 30, 2015, 3:37 p.m. UTC
score: 187200
Pupil Session Times. Madete -- W13:00 Kilgore -- R15:30 Sroka -- R15:00 Davis -- W10:00 Warner -- R16:00 Harper -- W14:00 Jenkner -- R16:30 Moore -- W11:00 Bridges -- T15:00 Merrill -- W10:30 Longbehn -- T15:30 Tomaska [x2] -- T14:00, R14:00 Zeman -- W13:30 Nelson -- T14:30 Santostefano -- R14:30 Spiering -- W12:30 Bialis [x2] -- W12:00, R17: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 T10:00 i1 T10:30 i1 p1 T14:00 Tomaska [x2] i1 p1 T14:30 Nelson i1 p1 T15:00 Bridges i1 p1 T15:30 Longbehn i1 p1 W10:00 Davis i1 p1 W10:30 Merrill i1 p1 W11:00 Moore i1 W11:30 i1 p1 W12:00 Bialis [x2] i1 p1 W12:30 Spiering i1 p1 W13:00 Madete i1 p1 W13:30 Zeman i1 p1 W14:00 Harper i1 W14:30 i1 W15:00 i1 W15:30 i1 W16:00 i1 R10:00 i1 R10:30 i1 p1 R14:00 Tomaska [x2] i1 p1 R14:30 Santostefano i1 p1 R15:00 Sroka i1 p1 R15:30 Kilgore i1 p1 R16:00 Warner i1 p1 R16:30 Jenkner i1 p1 R17:00 Bialis [x2]