a left right assignment graphic for a generic matrix with 20 discrete elements according to an embodiment of the invention fig8 is a representation of a generic matrix consistent with the left right assignment graphic in fig7 according to an embodiment of the invention in the embodiment illustrated in fig7 and 8 ten 10 discrete pairs of discrete elements are scheduled in each of nineteen 19 arrays together fig7 and 8 illustrate that the balance and non conflict features described above are maintained as the number of scheduled discrete elements is increased fig9 is a sports related specific application schedule according to an embodiment of the invention in particular fig9 illustrates a specific application schedule 900 an assignment table 905 and a left right assignment graphic 910 in this example a small town has a basketball league consisting of 10 teams the league 39 s season lasts 9 weeks so that every team has the opportunity to play every other team once over the course of the season basketball court availability is at a minimum the baldwin teams have only two courts the jones park teams share a single court and the remaining teams have only one court each they must all play at the same time on friday night of each week and cannot stagger start times fair scheduling always attempts to balance the number of home and away games alternates home and away games and minimizes same court same time assignments since there are 10 discrete elements to be scheduled the generic matrix 200 300 400 or 505 may be used a feature of the generic matrix 200 300 or 400 is that.