Solver Run Detail

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= 208 #constraint= 52 #product= 139 sizeproduct= 14
Penalty 0 for term "leave early" (0 + 0)
Penalty 73200 for term "instructor preference" (73200 + 0)
Penalty -210000 for term "day off" (-210000 + 0)
Penalty 0 for term "arrive late" (0 + 0)
Penalty 30000 for term "no break" (30000 + 0)
Penalty 12000 for term "pupil preference" (12000 + 0)
Total Penalty -94800 for term "pupil preference" (-94800 + 0)

Optimizer Output:

c clasp version 3.1.0
c Reading from /tmp/tmp5jfiyw2d
c Solving...
o 89850
o 71100
o 61800
o 51900
o 42000
o 29100
o 23700
o 14400
o 7500
o -1800
o -39450
o -42450
o -51450
o -88800
o -91800
o -94800
c Answer: 16
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
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
v -x121 -x122 -x123 -x124 -x125 -x126 -x127 -x128 -x129 -x130 -x131 -x132
v -x133 -x134 x135 -x136 -x137 -x138 -x139 -x140 -x141 -x142 -x143 -x144
v -x145 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
v -x170 -x171 -x172 -x173 x174 -x175 -x176 x177 -x178 -x179 -x180 -x181 -x182
v -x183 -x184 -x185 -x186 -x187 -x188 -x189 -x190 -x191 -x192 x193 -x194
v -x195 -x196 -x197 x198 -x199 -x200 -x201 -x202 -x203 -x204 -x205 -x206
v -x207 x208
s OPTIMUM FOUND
c
c Models : 16
c Optimum : yes
c Optimization : -94800
c Calls : 1
c Time : 1.651s (Solving: 1.65s 1st Model: 0.00s Unsat: 0.45s)
c CPU Time : 1.590s
c Threads : 8 (Winner: 1)

Pupil Session Times.
Michael Sayers -- W12:30
Danny Warwick [60min] -- T13:30
Janie Kilgore -- W14:00
Claire Chaikin [60min] -- W16:30
Jon Matthew -- W15:00
James Mann -- T14:30
Joey Tomaska [60min] -- T11:00
Kendall Parchman [60min] -- W15:30
Brian Warner -- W17:30
Roger Kaufman -- W14:30
Nicholas Lulloff -- T13:00
Adam Raso -- T15:00
Sam Mason [60min] -- T12:00
French Indep Study -- W12:00
Keith Murphy [60min] -- W13:00
Nathalie Corbett -- T15: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 p2 T11:00 Joey Tomaska [60min]
i1    T11:30 ---Lesson Ongoing---
i1 p1 T12:00 Sam Mason [60min]
i1    T12:30 ---Lesson Ongoing---
i1 p1 T13:00 Nicholas Lulloff
i1 p1 T13:30 Danny Warwick [60min]
i1    T14:00 ---Lesson Ongoing---
i1 p1 T14:30 James Mann
i2 p1 T15:00 Adam Raso
i2 p1 T15:30 Nathalie Corbett

i1 p1 W12:00 French Indep Study
i1 p1 W12:30 Michael Sayers
i1 p1 W13:00 Keith Murphy [60min]
i1    W13:30 ---Lesson Ongoing---
i1 p2 W14:00 Janie Kilgore
i1 p2 W14:30 Roger Kaufman
i2 p1 W15:00 Jon Matthew
i2 p1 W15:30 Kendall Parchman [60min]
i2    W16:00 ---Lesson Ongoing---
i2 p2 W16:30 Claire Chaikin [60min]
i2    W17:00 ---Lesson Ongoing---
i2 p1 W17:30 Brian Warner

i1    R10:00
i1    R10:30
i1    R11:00
i1    R11:30
i1    R12:00
i1    R12:30
i1    R13:00
i1    R13:30
i1    R14:00
i1    R14:30
i1    R15:00
i1    R15:30
i1    R16:00
i1    R16:30