Bugfix/matrix utilization

[mjducut-oe]

PR Overview

Contains fix necessary for the scheduler to be able to read and fetch resource intervals even if they are not continuous.

Summary of updates (per function)

• TaskAllocator.allocate_task - The original implementation didn’t account for the scenario where both assignments and constraints matrices are present. It only solved the first available matrix (either assignments or constraints) using the or condition. The changes processes both constraints AND assignment matrices before constraints matrix gets trimmed so the values are much closer and will not throw a mismatch error.
• TaskAllocator._get_resource_intervals - The updated version is more flexible and comprehensive, as it can handle multiple non-contiguous intervals per resource.
• TaskAllocator._find_indexes - Uses vectorized operations on masked arrays to efficiently detect where the resource becomes available. Now detects both starts and ends of multiple windows using transition logic between masked and unmasked values and comparisons between consecutive values.
• Matrix.trim_end - Allows differences within an absolute tolerance (atol=1e-8) to enable a more laid-back comparison.
• HeuristicSolver.solve - Improved flexibility in the second version to handle multiple intervals per resource.