[[["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\u003eTimeTablingPerTask is a propagator in C++ that filters based on a strongly quadratic version of Time Tabling, similar to the CumulativeTimeTable propagator.\u003c/p\u003e\n"],["\u003cp\u003eIt works in conjunction with \u003ccode\u003eSchedulingConstraintHelper\u003c/code\u003e and \u003ccode\u003eSchedulingDemandHelper\u003c/code\u003e to manage task scheduling within a given capacity.\u003c/p\u003e\n"],["\u003cp\u003eThe primary method, \u003ccode\u003ePropagate\u003c/code\u003e, aims to enforce constraints and ensure feasibility of the schedule.\u003c/p\u003e\n"],["\u003cp\u003eThere's potential for optimization if task alternatives are known, enabling further constraint pushing.\u003c/p\u003e\n"]]],["The `TimeTablingPerTask` class in C++ implements a strongly quadratic time tabling filter, similar to `CumulativeTimeTable`. It features a `Propagate` method (returning a boolean) and a `RegisterWith` method (taking a `GenericLiteralWatcher`). The constructor `TimeTablingPerTask` takes arguments for `capacity`, `SchedulingConstraintHelper`, `SchedulingDemandHelper`, and a `Model`. There is a planned improvement to leverage `SchedulingDemandHelper`, particularly for tasks with fixed alternatives.\n"],null,[]]
