Binpacking problem modeled as cumulative scheduling problem.

• First formulation with 'cumulative' constraints, defining a search strategy for variables (d4backup2_ka.mos).
• Alternative formulation using task and resource objects; implementing a variable-based search strategy (d4backup3a_ka.mos and d4backup3b_ka.mos)
• or using the default scheduling search (d4backup3_ka.mos).
• Model version d4backup3c_ka.mos shows how to change the propagation algorithm for resource constraints.

Further explanation of this example: 'Xpress Kalis Mosel User Guide', Section 5.4 Cumulative scheduling: discrete resources

! Data file for `d4backup.mos'

SIZE: [46 55 62 87 108 114 137 164 253 364 372 388 406 432 461 851]
CAP: 1440