Solver Version v0.5
Started at: Jan. 15, 2015, 11:09 p.m. UTC
Current State: Solver Done
Score: 315600
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= 151 #constraint= 40 #product= 108 sizeproduct= 14
Penalty -210000 for term "day off" (-210000 + 0)
Penalty 0 for term "instructor preference" (0 + 0)
Penalty -105600 for term "leave early" (-105600 + 0)
Penalty 0 for term "pupil preference" (0 + 0)
Penalty 0 for term "arrive late" (0 + 0)
Penalty 0 for term "no break" (0 + 0)
Total Penalty -315600 for term "no break" (-315600 + 0)
Optimizer Output:
c clasp version 3.1.0
c Reading from /tmp/tmpekxbdwq_
c Solving...
o -18600
o -18900
o -28200
o -37200
o -37500
o -37800
o -114300
o -114900
o -118800
o -128100
o -138000
o -138300
o -140700
o -141000
o -144300
o -181800
o -277200
o -309300
o -312300
o -312600
o -315600
c Answer: 21
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
v -x35 x36 -x37 -x38 -x39 -x40 -x41 x42 -x43 -x44 -x45 -x46 x47 -x48 -x49
v -x50 -x51 -x52 -x53 -x54 x55 -x56 -x57 -x58 -x59 x60 -x61 -x62 -x63 -x64
v -x65 -x66 -x67 -x68 -x69 -x70 -x71 -x72 -x73 -x74 x75 x76 -x77 -x78 -x79
v -x80 -x81 -x82 -x83 -x84 x85 -x86 -x87 -x88 -x89 -x90 -x91 -x92 -x93 -x94
v x95 -x96 -x97 -x98 -x99 -x100 -x101 -x102 -x103 -x104 -x105 x106 -x107
v x108 -x109 -x110 -x111 -x112 -x113 -x114 -x115 -x116 -x117 -x118 -x119
v -x120 -x121 -x122 -x123 -x124 -x125 -x126 -x127 -x128 -x129 -x130 -x131
v -x132 x133 -x134 -x135 -x136 -x137 -x138 -x139 -x140 -x141 -x142 -x143
v x144 -x145 -x146 x147 -x148 -x149 x150 -x151
s OPTIMUM FOUND
c
c Models : 21
c Optimum : yes
c Optimization : -315600
c Calls : 1
c Time : 4.732s (Solving: 4.73s 1st Model: 0.00s Unsat: 4.53s)
c CPU Time : 4.580s
c Threads : 8 (Winner: 7)
Created at: Jan. 15, 2015, 11:09 p.m. UTC
score: 315600
Pupil Session Times. Mackenzie Anne Moore -- W13:00 Jessica Jenkner -- W15:30 Ryan Hamman -- W14:00 Maggie Harper -- W11:00 Regina Merrill -- W10:00 Victor Schneider -- T10:30 Shain Longbehn -- W10:30 Bobby Ganzer -- T9:30 Ben Zeman -- W12:00 Steve Madete -- W11:30 Jane Kilgore -- W14:30 Leah Banawa -- T10:00 Lauren Nelson -- W16:00 John Bialis -- W12:30 Mike Spiering -- W9:30 Joe Tomaska -- W15: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 T9:30 Bobby Ganzer i1 p1 T10:00 Leah Banawa i1 p1 T10:30 Victor Schneider i1 T11:00 i0 T11:30 ***Forced to be Free*** i0 T12:00 ***Forced to be Free*** i0 T12:30 ***Forced to be Free*** i0 T13:00 ***Forced to be Free*** i0 T13:30 ***Forced to be Free*** i0 T14:00 ***Forced to be Free*** i1 T14:30 i1 T15:00 i1 T15:30 i1 T16:00 i1 p1 W9:30 Mike Spiering i1 p1 W10:00 Regina Merrill i1 p1 W10:30 Shain Longbehn i1 p1 W11:00 Maggie Harper i1 p1 W11:30 Steve Madete i1 p1 W12:00 Ben Zeman i1 p1 W12:30 John Bialis i1 p1 W13:00 Mackenzie Anne Moore i1 W13:30 i1 p1 W14:00 Ryan Hamman i1 p1 W14:30 Jane Kilgore i1 p1 W15:00 Joe Tomaska i1 p1 W15:30 Jessica Jenkner i1 p1 W16:00 Lauren Nelson i1 R9:30 i1 R10:00 i1 R10:30 i1 R11:00 i0 R11:30 ***Forced to be Free*** i0 R12:00 ***Forced to be Free*** i0 R12:30 ***Forced to be Free*** i0 R13:00 ***Forced to be Free*** i0 R13:30 ***Forced to be Free*** i0 R14:00 ***Forced to be Free*** i1 R14:30 i1 R15:00 i1 R15:30 i1 R16:00