A k-optimal solution set ¦[={S1,...,Sk} of a given scheduling problem is a set of schedules such that no schedule S which is not contained in ¦[ is better than any Si, i=1,...,k. k-optimal sets are useful in offering alternatives to a single optimal schedule. In this paper algorithms are presented which compute k-optimal sets for various scheduling problems for which the optimal schedule can be computed in polynomial time.
