[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2024-08-06 UTC."],[[["\u003cp\u003eThe C++ reference for 'disjunctive' provides classes for modeling and solving disjunctive scheduling problems, where tasks cannot overlap in time.\u003c/p\u003e\n"],["\u003cp\u003eThese classes offer various functionalities such as detecting precedences, managing task sets, and applying specific scheduling constraints for optimization.\u003c/p\u003e\n"],["\u003cp\u003eDevelopers can leverage these tools to efficiently handle scheduling scenarios within their C++ applications, facilitating optimized solutions for resource allocation and task sequencing.\u003c/p\u003e\n"]]],["The provided C++ documentation outlines classes related to disjunctive constraints within an optimization context. Key components include `AllIntervalsHelper`, `CombinedDisjunctive`, and `DisjunctivePrecedences`, indicating tools for managing and combining interval-based constraints. `DisjunctiveDetectablePrecedences`, `DisjunctiveEdgeFinding`, and `DisjunctiveNotLast` suggest methods for inferring and enforcing temporal relationships between tasks. `DisjunctiveOverloadChecker` verifies resource capacity, `DisjunctiveWithTwoItems` manages constraints on pairs, and `TaskSet` likely represents collections of tasks.\n"],null,[]]
