Timetabling and Scheduling Problems

Several points should now be made in connection with the problem in question. First, the reduction of the determinantal equation to an explicit polynomial is not necessary and, indeed, leads to a more ill-conditioned problem by the reduction to a fewer number of coefficients (from the array to the polynomial), and introduces possible inaccuracy problems. Scaling problems, magnified by a data-condensation process, may be handled easily in the original array if, in fact, such difficulties exist initially. Although the computations for the results below were computed using complex arithmetic (in an existing IBM 7044 computer program), the same results could have been obtained for this case with real variables since no complex conjugate roots are present to establish symmetry problems in applying the real secant method. The values of the determinant were obtained using elimination methods, again due to the usage of a general-purpose program, whereas the