Quantum computing is a computational paradigm for solving (exactly or approximately) difficult combinatorial optimization problems. One degree of freedom that is available is the so-called annealing schedule, which defines how the quantum computation evolves from the start of the computation to the end of the computation. This schedule is defined by anneal offsets, which can be different for each quantum bit (qubit) in the quantum computer. The choice of annealing schedule can have a dramatic impact on the performance of the computer. In this disclosure we provide a method for selecting and/or modifying the annealing schedule based on the problem to be solved.