Solver Version v0.6
Started at: Jan. 29, 2016, 12:20 p.m. UTC
Current State: Solver Done
Score: 30000
Solution: Optimal Solution Found
Options:
Arrive Late Bonus: 0
Leave Early Bonus: 200
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: 30min M 11:30-13:30,30min T 11:30-13:30,30min W 12:30-15:30,30min R 12:30-15: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= 145 #constraint= 40 #product= 68 sizeproduct= 12
Penalty 0 for term "day off" (0 + 0)
Penalty 0 for term "pupil preference" (0 + 0)
Penalty -30000 for term "leave early" (-30000 + 0)
Penalty 0 for term "no break" (0 + 0)
Penalty 0 for term "arrive late" (0 + 0)
Penalty 0 for term "instructor preference" (0 + 0)
Total Penalty -30000 for term "instructor preference" (-30000 + 0)
Optimizer Output:
c clasp version 3.1.3
c Reading from /tmp/tmpb92jj3zr
c Solving...
o 19800
o 9900
o 0
o -6000
o -12000
o -15000
o -18000
o -24000
o -30000
c Answer: 9
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
s OPTIMUM FOUND
c
c Models : 9
c Optimum : yes
c Optimization : -30000
c Calls : 1
c Time : 0.021s (Solving: 0.02s 1st Model: 0.00s Unsat: 0.01s)
c CPU Time : 0.010s
c Threads : 8 (Winner: 6)
Created at: Jan. 29, 2016, 12:20 p.m. UTC
score: 30000
Pupil Session Times. Lexie -- R16:00 Rosie -- R12:00 Ingrid [60min] -- W11:00 Megan -- W13:30 SaraA -- W14:00 SaraB -- R11:30 Katie -- R13:00 Sabrina [60min] -- R13:30 Diana -- W12:00 Anna -- R16:30 Haley -- R15:00 Breanne -- R15:30 Kelly -- R14:30 Laura -- W12:30 Lizzie -- W13: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 W11:00 Ingrid [60min] i1 W11:30 ---Lesson Ongoing--- i1 p1 W12:00 Diana i1 p1 W12:30 Laura i1 p1 W13:00 Lizzie i1 p1 W13:30 Megan i1 p1 W14:00 SaraA i1 W14:30 i1 W15:00 i1 W15:30 i1 W16:00 i1 W16:30 i1 R11:00 i1 p1 R11:30 SaraB i1 p1 R12:00 Rosie i1 R12:30 i1 p1 R13:00 Katie i1 p1 R13:30 Sabrina [60min] i1 R14:00 ---Lesson Ongoing--- i1 p1 R14:30 Kelly i1 p1 R15:00 Haley i1 p1 R15:30 Breanne i1 p1 R16:00 Lexie i1 p1 R16:30 Anna