Placements developer guide
    Preparing search index...

    The search budget. The legacy scheduler ran 101 restarts of 2000 steps with 20 neighbours each; restarts: 1, iterations: 0 is the plain greedy first fit.

    interface DraftSearch {
        iterations: number;
        neighbours: number;
        restarts: number;
    }
    Index
    iterations: number

    Annealing steps per run. The temperature falls linearly from 1 towards 0.

    neighbours: number

    Neighbours evaluated per step.

    restarts: number

    Independent runs. The first starts from the Monday-to-Friday greedy fit.