Priority-Generating Functions Ordered Sets of Jobs

As mentioned in the previous chapters, a number of scheduling theory problems can be formulated in terms of optimizing functions over sets of permutations of the elements of a given finite set N. In particular, among such problems are those of finding optimal single-machine schedules for a finite set of jobs, provided that preemption is not allowed and that at most one job is processed at a time.