Solver Version v0.5
Started at: Oct. 10, 2015, 6:36 p.m. UTC
Current State: Solver Done
Score: 0
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:
Scheduler Output:
Solving with a time limit of 60 seconds of not improving the solution or a total time limit of 600 seconds
* #variable= 173 #constraint= 47 #product= 84 sizeproduct= 13
Penalty 0 for term "pupil preference" (0 + 0)
Penalty 0 for term "arrive late" (0 + 0)
Penalty 0 for term "leave early" (0 + 0)
Penalty 0 for term "no break" (0 + 0)
Penalty 0 for term "day off" (0 + 0)
Penalty 0 for term "instructor preference" (0 + 0)
Total Penalty 0 for term "instructor preference" (0 + 0)
Optimizer Output:
c clasp version 3.1.3
c Reading from /tmp/tmpa13v0zho
c Solving...
o 26700
o 21900
o 6000
o 0
c Answer: 4
v x1 x2 x3 x4 x5 x6 x7 x8 x9 x10 x11 x12 -x13 x14 x15 x16 x17 x18 x19 x20
v x21 x22 x23 x24 -x25 x26 -x27 -x28 -x29 -x30 -x31 x32 -x33 -x34 -x35 -x36
v -x37 -x38 -x39 -x40 -x41 -x42 -x43 x44 -x45 -x46 -x47 -x48 -x49 -x50 -x51
v x52 -x53 -x54 -x55 -x56 -x57 -x58 x59 -x60 x61 -x62 -x63 -x64 -x65 x66
v -x67 -x68 -x69 -x70 x71 -x72 -x73 -x74 -x75 -x76 -x77 -x78 -x79 -x80 -x81
v -x82 -x83 -x84 x85 -x86 -x87 -x88 -x89 -x90 -x91 -x92 -x93 -x94 -x95 -x96
v -x97 x98 -x99 -x100 x101 -x102 -x103 -x104 x105 x106 -x107 -x108 -x109
v -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 -x158
v -x159 -x160 -x161 -x162 x163 -x164 -x165 -x166 -x167 x168 -x169 -x170 -x171
v -x172 x173
s OPTIMUM FOUND
c
c Models : 4
c Optimum : yes
c Optimization : 0
c Calls : 1
c Time : 10.841s (Solving: 10.84s 1st Model: 0.01s Unsat: 10.83s)
c CPU Time : 10.750s
c Threads : 8 (Winner: 4)
Created at: Oct. 10, 2015, 6:47 p.m. UTC
score: 0
Pupil Session Times. Madete -- W12:30 Kilgore -- T15:00 Sroka -- T14:00 Davis -- W10:00 Warner -- R17:00 Harper -- W14:30 Jenkner -- W16:00 Moore -- W15:00 Bridges -- W13:00 Merrill -- W13:30 Longbehn -- W12:00 Tomaska [x2] -- T15:30, R14:00 Zeman -- W15:30 Nelson -- T14:30 Santostefano -- R16:30 Spiering -- R14:30 Bialis [x2] -- W11:30, R16:00 Murphy [60min] -- R15:00 Young [60min] -- W10:30 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 p1 T14:00 Sroka i1 p1 T14:30 Nelson i1 p1 T15:00 Kilgore i1 p1 T15:30 Tomaska [x2] i1 p1 W10:00 Davis i1 p1 W10:30 Young [60min] i1 W11:00 ---Lesson Ongoing--- i1 p1 W11:30 Bialis [x2] i1 p1 W12:00 Longbehn i1 p1 W12:30 Madete i1 p1 W13:00 Bridges i1 p1 W13:30 Merrill i1 W14:00 i1 p1 W14:30 Harper i1 p1 W15:00 Moore i1 p1 W15:30 Zeman i1 p1 W16:00 Jenkner i1 p1 R14:00 Tomaska [x2] i1 p1 R14:30 Spiering i1 p1 R15:00 Murphy [60min] i1 R15:30 ---Lesson Ongoing--- i1 p1 R16:00 Bialis [x2] i1 p1 R16:30 Santostefano i1 p1 R17:00 Warner