[[["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."],[[["This C++ reference documents functions related to scheduling cuts within the or-tools library."],["It provides a variety of cut generators for different scheduling constraints, including cumulative, no-overlap, and no-overlap2d constraints."],["Each function is listed with its return type, arguments, and a link to its definition in the or-tools source code."],["These functions assist in optimizing scheduling problems by generating cuts that tighten the solution space."],["Developers can use these cut generators to improve the performance of their scheduling models and find better solutions."]]],["The content outlines C++ functions for generating cuts in scheduling problems, focusing on cumulative and no-overlap constraints. Key functions include `ComputeMinSumOfWeightedEndMins`, which calculates minimum sums, and several `Create...CutGenerator` functions. These generator functions, such as `CreateCumulativeEnergyCutGenerator` and `CreateNoOverlap2dEnergyCutGenerator`, produce `CutGenerator` objects for various constraint types. These functions manage scheduling demands, capacity, makespan, and intervals to optimize scheduling solutions.\n"]]
