Production Fine Planning is often performed directly using all information and assuming that it is fixed. In practice, however, this information changes regularly and the plan has to be adapted. This often means a complete rescheduling of all operations. We present a new approach to this problem by optimizing priority rules that can sort the available next actions. These priority rules often yield similar results even though they do not resemble each other. By using genetic programming to build these priority rules, a distributed system to compute the simulations and a solution archive with a cache of hundreds of thousands of priority rules, new insights into priority rule-based optimization are gained. This archive does not only speed up calculation by avoiding re-simulation of the same rule but can provide a pseudo Pareto front of shorter sub-optimal solutions that facilitate interpretation of the more complex rules and their evolution during the optimization process.