The Court of Appeals of Virginia Uses Integer Programming and Cloud Computing to Schedule Sessions

Published Online:https://doi.org/10.1287/inte.1110.0598

References

  • Atamtürk A., Nemhauser G. L., Savelsbergh M. W. P. (2000) Conflict graphs in solving integer programming problems. Eur. J. Oper. Res. 121(1):40–55.CrossrefGoogle Scholar
  • Brown J., Lee A. H. (2000a) Neutral assignment of judges at the Court of Appeals. Texas Law Rev. 78(5):1037–1116.Google Scholar
  • Brown J., Lee A. H. (2000b) Circuit practices. . Accessed July 21, 2011, http://law.du.edu/images/uploads/neutral-assignment/Neutral_assignment_links.pdf.Google Scholar
  • Burke E. K., de Causmaecker P., vanden Berghe G., van Landghem H. (2004) The state of the art of nurse rostering. J. Scheduling 7(6):441–499.CrossrefGoogle Scholar
  • Carter M. W., Laporte G., Chinneck J. W. (1994) A general examination scheduling system. Interfaces 24(3):109–120.LinkGoogle Scholar
  • Easton K., Nemhauser G., Trick M. (2003) Solving the travelling tournament problem: A combined integer programming and constraint programming approach. Practice and Theory of Automated Timetabling IV. Lecture Notes in Computer Science, Vol. 2740 (Springer-Verlag, Berlin), 100–109.CrossrefGoogle Scholar
  • Ernst A. T., Jiang H., Krishnamoorthy M., Sier D. (2004) Staff scheduling and rostering: A review of applications, methods and models. Eur. J. Oper. Res. 153(1):3–27.CrossrefGoogle Scholar
  • Farmer A., Smith J. S., Miller L. T. (2007) Scheduling umpire crews for professional tennis tournaments. Interfaces 37(2):187–196.LinkGoogle Scholar
  • Gao C., Johnson E. L., Smith B. C. (2009) Integrated airline fleet and crew robust planning. Transportation Sci. 43(1):2–16.LinkGoogle Scholar
  • Garey M. R., Johnson D. S. (1979) Computers and Intractability (Freeman, New York).Google Scholar
  • Guieu O., Chinneck J. W. (1999) Analyzing infeasible mixed-integer and integer linear programs. INFORMS J. Comput 11(1):63–77.LinkGoogle Scholar
  • Kastellec J. P. (2011) Hierarchical and collegial politics on the U.S. Courts of Appeals. J. Politics 73(2):345–361.CrossrefGoogle Scholar
  • Lejeune M. A., Yakova N. (2008) Showcase scheduling at Fred Astaire East Side Dance Studio. Interfaces 38(3):176–186.LinkGoogle Scholar
  • Miranda J. (2010) eClasSkeduler: A course scheduling system for the executive education unit at the Universidad de Chile. Interfaces 40(3):196–207.LinkGoogle Scholar
  • Norwood K. J. (1996) Shopping for a venue: The need for more limits on choice. Univ. Miami Law Rev. 50(2):267–334.Google Scholar
  • Padberg M. (1973) On the facial structure of set packing polyhedra. Math. Programming 5(1):199–215.CrossrefGoogle Scholar
  • Rasmussen R. V., Trick M. A. (2008) Round robin scheduling—A survey. Eur. J. Oper. Res. 188(3):617–636.CrossrefGoogle Scholar
  • Samaha A. M. (2009) Randomization in adjudication. William and Mary Law Rev. 51(1):1–86.Google Scholar
  • West D. B. (2001) Introduction to Graph Theory (Pearson Education, Urbana, IL).Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.