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= 56 #constraint= 22 #product= 77 sizeproduct= 12
Penalty -46500 for term "arrive late" (-46500 + 0)
Penalty 3000 for term "pupil preference" (3000 + 0)
Penalty 0 for term "no break" (0 + 0)
Penalty 0 for term "instructor preference" (0 + 0)
Penalty 0 for term "day off" (0 + 0)
Penalty -76800 for term "leave early" (-76800 + 0)
Total Penalty -120300 for term "leave early" (-120300 + 0)

Optimizer Output:

c clasp version 3.1.0
c Reading from /tmp/tmph6oxwa08
c Solving...
o -52500
o -54150
o -91800
o -101100
o -110400
o -110700
o -111000
o -120300
c Answer: 8
v -x1 -x2 x3 x4 x5 x6 x7 -x8 -x9 -x10 -x11 -x12 -x13 x14 x15 x16 x17 -x18
v -x19 -x20 -x21 -x22 x23 -x24 -x25 x26 -x27 -x28 -x29 -x30 -x31 -x32 x33
v -x34 -x35 -x36 -x37 -x38 x39 -x40 x41 -x42 -x43 x44 -x45 -x46 -x47 -x48
v x49 -x50 -x51 x52 -x53 -x54 -x55 -x56
s OPTIMUM FOUND
c
c Models : 8
c Optimum : yes
c Optimization : -120300
c Calls : 1
c Time : 0.004s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
c CPU Time : 0.000s
c Threads : 8 (Winner: 7)

Solver Run Detail

Schedule