Solver Run Detail

Options:

Arrive Late Bonus: 0
Leave Early Bonus: 500
Day Off Bonus: 0
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: 500,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= 103 sizeproduct= 14
Penalty -165000 for term "leave early" (-165000 + 0)
Penalty 60000 for term "instructor preference" (60000 + 0)
Penalty 0 for term "day off" (0 + 0)
Penalty 0 for term "arrive late" (0 + 0)
Penalty 0 for term "no break" (0 + 0)
Penalty 15000 for term "pupil preference" (15000 + 0)
Total Penalty -90000 for term "pupil preference" (-90000 + 0)

Optimizer Output:

c clasp version 3.1.0
c Reading from /tmp/tmp9n3zf5wo
c Solving...
o 148800
o 138900
o 135900
o 126000
o 123900
o 117000
o 114000
o 111000
o -38100
o -41100
o -47100
o -50100
o -68100
o -75000
o -87000
o -90000
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 -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 -x146
v -x147 -x148 -x149 -x150 -x151 -x152 x153 -x154 -x155 -x156 -x157 x158 -x159
v -x160 -x161 -x162 -x163 -x164 -x165 -x166 -x167 -x168 -x169 -x170 -x171
v -x172 -x173 x174 -x175 x176 -x177 -x178 -x179 -x180 -x181 -x182 -x183 -x184
v -x185 -x186 -x187 -x188 -x189 -x190 -x191 -x192 x193 -x194 -x195 -x196
v -x197 -x198 -x199 x200 -x201 -x202 -x203 -x204 -x205 x206 -x207 -x208
s OPTIMUM FOUND
c
c Models : 16
c Optimum : yes
c Optimization : -90000
c Calls : 1
c Time : 0.258s (Solving: 0.26s 1st Model: 0.00s Unsat: 0.05s)
c CPU Time : 0.230s
c Threads : 8 (Winner: 5)

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

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

i1 p2 R10:00 Joey Tomaska [60min]
i1    R10:30 ---Lesson Ongoing---
i1    R11:00
i1 p2 R11:30 Roger Kaufman
i1 p2 R12:00 Claire Chaikin [60min]
i1    R12:30 ---Lesson Ongoing---
i1    R13:00
i1    R13:30
i1    R14:00
i1    R14:30
i1    R15:00
i1    R15:30
i1    R16:00
i1    R16:30