IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v42y2012i6p544-553.html
   My bibliography  Save this article

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

Author

Listed:
  • J. Paul Brooks

    (Virginia Commonwealth University, Richmond, Virginia 23284)

Abstract

Each spring, a deputy clerk of the Court of Appeals of Virginia manually schedules panel sessions and assigns judges to sessions for the following calendar year. The information technology department for the Supreme Court of Virginia, the head of the judicial branch of government in Virginia, also serves the Court of Appeals of Virginia. In the spring of 2010, the staff of the Court of Appeals of Virginia and the information technology staff contacted Virginia Commonwealth University to explore a computational approach to generating schedules. Together, we developed a tool that uses integer programming to generate schedules; we used the method to generate the 2011 schedule, resulting in savings of up to 150 hours of work annually. The schedule satisfies all the constraints required by the court by properly distributing panel sessions among its districts throughout the year. The court places great importance on its members not becoming parochial; to that end, judges sit in disparate panels to hear litigants, who convene in regions throughout the state, to ensure a more uniform application of the law. The court used industrial-strength integer programming software to generate the 2011 schedule at low cost by using resources available on the Cloud.

Suggested Citation

  • J. Paul Brooks, 2012. "The Court of Appeals of Virginia Uses Integer Programming and Cloud Computing to Schedule Sessions," Interfaces, INFORMS, vol. 42(6), pages 544-553, December.
  • Handle: RePEc:inm:orinte:v:42:y:2012:i:6:p:544-553
    DOI: 10.1287/inte.1110.0598
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.1110.0598
    Download Restriction: no

    File URL: https://libkey.io/10.1287/inte.1110.0598?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Miguel A. Lejeune & Nevena Yakova, 2008. "Showcase Scheduling at Fred Astaire East Side Dance Studio," Interfaces, INFORMS, vol. 38(3), pages 176-186, June.
    2. Chunhua Gao & Ellis Johnson & Barry Smith, 2009. "Integrated Airline Fleet and Crew Robust Planning," Transportation Science, INFORMS, vol. 43(1), pages 2-16, February.
    3. Jaime Miranda, 2010. "eClasSkeduler: A Course Scheduling System for the Executive Education Unit at the Universidad de Chile," Interfaces, INFORMS, vol. 40(3), pages 196-207, June.
    4. Adam Farmer & Jeffrey S. Smith & Luke T. Miller, 2007. "Scheduling Umpire Crews for Professional Tennis Tournaments," Interfaces, INFORMS, vol. 37(2), pages 187-196, April.
    5. Michael W. Carter & Gilbert Laporte & John W. Chinneck, 1994. "A General Examination Scheduling System," Interfaces, INFORMS, vol. 24(3), pages 109-120, June.
    6. Rasmussen, Rasmus V. & Trick, Michael A., 2008. "Round robin scheduling - a survey," European Journal of Operational Research, Elsevier, vol. 188(3), pages 617-636, August.
    7. Ernst, A. T. & Jiang, H. & Krishnamoorthy, M. & Sier, D., 2004. "Staff scheduling and rostering: A review of applications, methods and models," European Journal of Operational Research, Elsevier, vol. 153(1), pages 3-27, February.
    8. Atamturk, Alper & Nemhauser, George L. & Savelsbergh, Martin W. P., 2000. "Conflict graphs in solving integer programming problems," European Journal of Operational Research, Elsevier, vol. 121(1), pages 40-55, February.
    9. Olivier Guieu & John W. Chinneck, 1999. "Analyzing Infeasible Mixed-Integer and Integer Linear Programs," INFORMS Journal on Computing, INFORMS, vol. 11(1), pages 63-77, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Benoit A. Aubert & Gilbert Babin & Hamza Aqallal, 2014. "Providing an Architecture Framework for Cyberjustice," Laws, MDPI, vol. 3(4), pages 1-23, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Özlü, Oğuzhan & Sokol, Joel, 2016. "An optimization approach to designing a baseball scout network," European Journal of Operational Research, Elsevier, vol. 255(3), pages 948-960.
    2. Michael A. Trick & Hakan Yildiz & Tallys Yunes, 2012. "Scheduling Major League Baseball Umpires and the Traveling Umpire Problem," Interfaces, INFORMS, vol. 42(3), pages 232-244, June.
    3. Jonas Ingels & Broos Maenhout, 2017. "Employee substitutability as a tool to improve the robustness in personnel scheduling," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(3), pages 623-658, July.
    4. Trick, Michael A. & Yildiz, Hakan, 2012. "Locally Optimized Crossover for the Traveling Umpire Problem," European Journal of Operational Research, Elsevier, vol. 216(2), pages 286-292.
    5. Michael A. Trick & Hakan Yildiz, 2011. "Benders' cuts guided large neighborhood search for the traveling umpire problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(8), pages 771-781, December.
    6. Maenhout, Broos & Vanhoucke, Mario, 2010. "A hybrid scatter search heuristic for personalized crew rostering in the airline industry," European Journal of Operational Research, Elsevier, vol. 206(1), pages 155-167, October.
    7. David Rea & Craig Froehle & Suzanne Masterson & Brian Stettler & Gregory Fermann & Arthur Pancioli, 2021. "Unequal but Fair: Incorporating Distributive Justice in Operational Allocation Models," Production and Operations Management, Production and Operations Management Society, vol. 30(7), pages 2304-2320, July.
    8. João P. Pita & Cynthia Barnhart & António P. Antunes, 2013. "Integrated Flight Scheduling and Fleet Assignment Under Airport Congestion," Transportation Science, INFORMS, vol. 47(4), pages 477-492, November.
    9. Vlad Stefan Barbu & Guglielmo D’Amico & Andreas Makrides, 2022. "A Continuous-Time Semi-Markov System Governed by Stepwise Transitions," Mathematics, MDPI, vol. 10(15), pages 1-12, August.
    10. Ellen Bockstal & Broos Maenhout, 2019. "A study on the impact of prioritising emergency department arrivals on the patient waiting time," Health Care Management Science, Springer, vol. 22(4), pages 589-614, December.
    11. Alonso-Ayuso, Antonio & Escudero, Laureano F. & Teresa Ortuno, M., 2003. "BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0-1 programs," European Journal of Operational Research, Elsevier, vol. 151(3), pages 503-519, December.
    12. Arpan Rijal & Marco Bijvank & Asvin Goel & René de Koster, 2021. "Workforce Scheduling with Order-Picking Assignments in Distribution Facilities," Transportation Science, INFORMS, vol. 55(3), pages 725-746, May.
    13. G Appa & D Magos & I Mourtos, 2004. "A Branch & Cut algorithm for a four-index assignment problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(3), pages 298-307, March.
    14. Detienne, Boris & Pridy, Laurent & Pinson, ric & Rivreau, David, 2009. "Cut generation for an employee timetabling problem," European Journal of Operational Research, Elsevier, vol. 197(3), pages 1178-1184, September.
    15. Kendall, Graham & Lenten, Liam J.A., 2017. "When sports rules go awry," European Journal of Operational Research, Elsevier, vol. 257(2), pages 377-394.
    16. Wei-Kun Chen & Liang Chen & Mu-Ming Yang & Yu-Hong Dai, 2018. "Generalized coefficient strengthening cuts for mixed integer programming," Journal of Global Optimization, Springer, vol. 70(1), pages 289-306, January.
    17. Esmaeilbeigi, Rasul & Mak-Hau, Vicky & Yearwood, John & Nguyen, Vivian, 2022. "The multiphase course timetabling problem," European Journal of Operational Research, Elsevier, vol. 300(3), pages 1098-1119.
    18. Martin Mariusz Lester, 2022. "Pseudo-Boolean optimisation for RobinX sports timetabling," Journal of Scheduling, Springer, vol. 25(3), pages 287-299, June.
    19. Florian Mischek & Nysret Musliu, 2019. "Integer programming model extensions for a multi-stage nurse rostering problem," Annals of Operations Research, Springer, vol. 275(1), pages 123-143, April.
    20. Gabrel, Virginie & Murat, Cécile & Thiele, Aurélie, 2014. "Recent advances in robust optimization: An overview," European Journal of Operational Research, Elsevier, vol. 235(3), pages 471-483.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:orinte:v:42:y:2012:i:6:p:544-553. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.