Solver Run Detail

Options:

Arrive Late Bonus: -10
Leave Early Bonus: 100
Day Off Bonus: -10
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= 219 #constraint= 51 #product= 139 sizeproduct= 14
Penalty -39000 for term "leave early" (-39000 + 0)
Penalty 300 for term "arrive late" (300 + 0)
Penalty 0 for term "instructor preference" (0 + 0)
Penalty 21000 for term "pupil preference" (21000 + 0)
Penalty 0 for term "no break" (0 + 0)
Penalty 0 for term "day off" (0 + 0)
Total Penalty -17700 for term "day off" (-17700 + 0)

Optimizer Output:

c clasp version 3.1.0
c Reading from /tmp/tmpgslt9d1n
c Solving...
o 52200
o 42300
o 39300
o 33300
o 33000
o 26100
o 25200
o 22200
o 19200
o 4200
o 1200
o 900
o 600
o -2100
o -5100
o -7500
o -8100
o -8700
o -11700
o -14100
o -14400
o -14700
o -17700
c Answer: 23
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
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
v -x157 -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
v -x182 -x183 -x184 -x185 -x186 -x187 -x188 -x189 -x190 -x191 x192 -x193
v -x194 -x195 -x196 -x197 -x198 x199 -x200 -x201 -x202 -x203 -x204 -x205
v -x206 -x207 -x208 -x209 -x210 -x211 -x212 -x213 -x214 -x215 -x216 x217
v -x218 -x219
s OPTIMUM FOUND
c
c Models : 23
c Optimum : yes
c Optimization : -17700
c Calls : 1
c Time : 0.201s (Solving: 0.20s 1st Model: 0.01s Unsat: 0.10s)
c CPU Time : 0.160s
c Threads : 8 (Winner: 1)

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

i1 p2 R10:00 Joey Tomaska [60min]
i1    R10:30 ---Lesson Ongoing---
i1    R11:00
i1 p2 R11:30 Claire Chaikin [60min]
i1    R12:00 ---Lesson Ongoing---
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