Joshua S. Friedman

Edge Minimizing the Student Conflict Graph

  • Joshua S. Friedman
    • Categories Scheduling

    In many schools, courses are given in sections. Prior to timetabling students need to be assigned to individual sections. We give a hybrid approximation sectioning algorithm that minimizes the number of edges (potential conflicts) in the student conflict graph (SCG). We start with a greedy algorithm to obtain a starting solution and then continue with … Read more

    Automated timetabling for small colleges and high schools using huge integer programs

  • Joshua S. Friedman
    • Categories Scheduling Tags , ,

    We formulate an integer program to solve a highly constrained academic timetabling problem at the United States Merchant Marine Academy. The IP instance that results from our real case study has approximately both 170,000 rows and columns and solves to near optimality in 12 hours, using a commercial solver. Our model is applicable to both … Read more