Java has never been employed so revolutionarily! This stunning code reads all the classes of all students in a data file and makes the best schedule given a certain number of teachers and periods. It does so by first generating all the possible permutations of a matrix whose dimensions are determined by the number of periods and classes per period. Then, the best schedule uses chi-squared algorithms to minimize variation in the number of students per period and the number of scheduling conflicts, involving students enrolled in more than one class in a single period.