Solver Run Detail

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= 30 #constraint= 0 #product= 90 sizeproduct= 6
Penalty 0 for term "pupil preference" (0 + 0)
Penalty 0 for term "arrive late" (0 + 0)
Penalty 0 for term "instructor preference" (0 + 0)
Penalty -675000 for term "day off" (-675000 + 0)
Penalty 0 for term "no break" (0 + 0)
Penalty 0 for term "leave early" (0 + 0)
Total Penalty -675000 for term "leave early" (-675000 + 0)

Optimizer Output:

c clasp version 3.1.0
c Reading from /tmp/tmpj0bb_3wc
c Solving...
o -675000
c Answer: 1
v -x1 -x2 -x3 -x4 -x5 -x6 -x7 -x8 -x9 -x10 -x11 -x12 -x13 -x14 -x15 -x16
v -x17 -x18 -x19 -x20 -x21 -x22 -x23 -x24 -x25 -x26 -x27 -x28 -x29 -x30
s OPTIMUM FOUND
c
c Models : 1
c Optimum : yes
c Optimization : -675000
c Calls : 1
c Time : 0.364s (Solving: 0.33s 1st Model: 0.00s Unsat: 0.33s)
c CPU Time : 0.320s
c Threads : 8 (Winner: 6)

Pupil Session Times.


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    M9:30 
i1    M10:15
i1    M11:00
i1    M11:45
i1    M12:30
i1    M13:15

i1    T9:30 
i1    T10:15
i1    T11:00
i1    T11:45
i1    T12:30
i1    T13:15

i1    W9:30 
i1    W10:15
i1    W11:00
i1    W11:45
i1    W12:30
i1    W13:15

i1    R9:30 
i1    R10:15
i1    R11:00
i1    R11:45
i1    R12:30
i1    R13:15

i1    F9:30 
i1    F10:15
i1    F11:00
i1    F11:45
i1    F12:30
i1    F13:15