This paper extends the algorithms which were given in Part I to cases in which there is no aane schedule, i.e. to problems whose parallel complexity is polynomial but not linear. The natural generalization is to multi-dimensional schedules with lexicographic ordering as temporal succession. Multidimensional aane schedules, are, in a sense, equivalent to polynomial schedules, and are much easier...