Solver Version v0.6
Started at: Feb. 4, 2018, 5:05 p.m. UTC
Current State: Solver Done
Score: -3000
Solution: Optimal Solution Found
Options:
Arrive Late Bonus: -10
Leave Early Bonus: 100
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: 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= 186 #constraint= 45 #product= 126 sizeproduct= 16
Penalty -15000 for term "leave early" (-15000 + 0)
Penalty 0 for term "arrive late" (0 + 0)
Penalty 0 for term "instructor preference" (0 + 0)
Penalty 18000 for term "pupil preference" (18000 + 0)
Penalty 0 for term "no break" (0 + 0)
Penalty 0 for term "day off" (0 + 0)
Total Penalty 3000 for term "day off" (3000 + 0)
Optimizer Output:
c clasp version 3.1.0
c Reading from /tmp/tmp_t17a7es
c Solving...
o 41100
o 34200
o 24300
o 21300
o 18300
o 15000
o 12600
o 12300
o 12000
o 9600
o 9300
o 9000
o 6000
o 3300
o 3000
c Answer: 15
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 -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
v -x170 x171 -x172 -x173 -x174 -x175 -x176 -x177 x178 -x179 -x180 -x181 -x182
v -x183 -x184 -x185 -x186
s OPTIMUM FOUND
c
c Models : 15
c Optimum : yes
c Optimization : 3000
c Calls : 1
c Time : 0.899s (Solving: 0.90s 1st Model: 0.00s Unsat: 0.61s)
c CPU Time : 0.850s
c Threads : 8 (Winner: 3)
Created at: Feb. 4, 2018, 5:05 p.m. UTC
score: -3000
Pupil Session Times. Michael Sayers -- M12:30 Danny Warwick [60min] -- R13:30 Janie Kilgore -- M14:30 Claire Chaikin [60min] -- M16:00 Jon Matthew -- R13:00 Daniel Clark -- M14:00 James Mann -- M13:30 Joey Tomaska [60min] -- R10:00 Kendall Parchman [60min] -- M15:00 Brian Warner -- M17:00 Roger Kaufman -- R15:30 Nicholas Lulloff -- R14:30 Adam Raso -- R15:00 Sam Mason [60min] -- R12:00 French Indep Study -- M12: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 p1 M12:00 French Indep Study i1 p1 M12:30 Michael Sayers i1 M13:00 i1 p1 M13:30 James Mann i1 p2 M14:00 Daniel Clark i1 p2 M14:30 Janie Kilgore i1 p1 M15:00 Kendall Parchman [60min] i1 M15:30 ---Lesson Ongoing--- i1 p2 M16:00 Claire Chaikin [60min] i1 M16:30 ---Lesson Ongoing--- i1 p1 M17:00 Brian Warner i1 M17:30 i1 p2 R10:00 Joey Tomaska [60min] i1 R10:30 ---Lesson Ongoing--- i1 R11:00 i1 R11:30 i1 p1 R12:00 Sam Mason [60min] i1 R12:30 ---Lesson Ongoing--- i1 p1 R13:00 Jon Matthew i1 p1 R13:30 Danny Warwick [60min] i1 R14:00 ---Lesson Ongoing--- i1 p1 R14:30 Nicholas Lulloff i1 p2 R15:00 Adam Raso i1 p2 R15:30 Roger Kaufman i1 R16:00 i1 R16:30 i1 R17:00 i1 R17:30