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

Assigning Panels to Meeting Rooms at the National Science Foundation

Author

Listed:
  • Jason J. Sauppe

    (Department of Computer Science, University of Wisconsin–La Crosse, La Crosse, Wisconsin 54601)

  • David R. Morrison

    (Inverse Limit, The Woodlands, Texas 77381)

  • Sheldon H. Jacobson

    (Department of Computer Science, University of Illinois at Urbana–Champaign, Urbana, Illinois 61801)

Abstract

The National Science Foundation provides funding for scientific research throughout the United States. Its program directors solicit requests for funding through calls for proposals and then assemble panels of experts to review these requests. The program directors are responsible for reserving meeting rooms for each of the panels. Our work automates much of the room reservation process by constructing and solving an optimization model that determines how panels should be assigned to available rooms to maximize the utilization of available meeting rooms. The model accommodates multiday panels, differences between the rooms (e.g., capacity, projector support), and double-booking constraints for both rooms and panel organizers. Staff members at the National Science Foundation are currently using this software, and have employed it to successfully schedule engineering directorate panels for the 2014–2015 review year.

Suggested Citation

  • Jason J. Sauppe & David R. Morrison & Sheldon H. Jacobson, 2015. "Assigning Panels to Meeting Rooms at the National Science Foundation," Interfaces, INFORMS, vol. 45(6), pages 529-542, December.
    • Handle: RePEc:inm:orinte:v:45:y:2015:i:6:p:529-542
    DOI: 10.1287/inte.2015.0827
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.2015.0827
    Download Restriction: no
    File URL: https://libkey.io/10.1287/inte.2015.0827?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. Michael W. Carter & Craig A. Tovey, 1992. "When Is the Classroom Assignment Problem Hard?," Operations Research, INFORMS, vol. 40(1-supplem), pages 28-39, February.
    2. C. Roger Glassey & Michael Mizrach, 1986. "A Decision Support System for Assigning Classes to Rooms," Interfaces, INFORMS, vol. 16(5), pages 92-100, October.
    3. Julia Chuzhoy & Rafail Ostrovsky & Yuval Rabani, 2006. "Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems," Mathematics of Operations Research, INFORMS, vol. 31(4), pages 730-738, November.
    4. Jebali, AIda & Hadj Alouane, Atidel B. & Ladet, Pierre, 2006. "Operating rooms scheduling," International Journal of Production Economics, Elsevier, vol. 99(1-2), pages 52-62, February.
    Full references (including those not matched with items on IDEAS)

    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. Clarence H. Martin, 2004. "Ohio University's College of Business Uses Integer Programming to Schedule Classes," Interfaces, INFORMS, vol. 34(6), pages 460-465, December.
    2. Yim, Seho & Hong, Sung-Pil & Park, Myoung-Ju & Chung, Yerim, 2022. "Inverse interval scheduling via reduction on a single machine," European Journal of Operational Research, Elsevier, vol. 303(2), pages 541-549.
    3. Antoon W.J. Kolen & Jan Karel Lenstra & Christos H. Papadimitriou & Frits C.R. Spieksma, 2007. "Interval scheduling: A survey," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(5), pages 530-543, August.
    4. repec:ipg:wpaper:2013-014 is not listed on IDEAS
    5. Craig A. Tovey, 2002. "Tutorial on Computational Complexity," Interfaces, INFORMS, vol. 32(3), pages 30-61, June.
    6. Karsten Schwarz & Michael Römer & Taïeb Mellouli, 2019. "A data-driven hierarchical MILP approach for scheduling clinical pathways: a real-world case study from a German university hospital," Business Research, Springer;German Academic Association for Business Research, vol. 12(2), pages 597-636, December.
    7. repec:ipg:wpaper:14 is not listed on IDEAS
    8. Jeffrey Kingston, 2012. "Resource assignment in high school timetabling," Annals of Operations Research, Springer, vol. 194(1), pages 241-254, April.
    9. H. Fei & C. Chu & N. Meskens, 2009. "Solving a tactical operating room planning problem by a column-generation-based heuristic procedure with four criteria," Annals of Operations Research, Springer, vol. 166(1), pages 91-108, February.
    10. Silva, Thiago A.O. & de Souza, Mauricio C. & Saldanha, Rodney R. & Burke, Edmund K., 2015. "Surgical scheduling with simultaneous employment of specialised human resources," European Journal of Operational Research, Elsevier, vol. 245(3), pages 719-730.
    11. Fei, Hongying & Meskens, Nadine & Combes, Catherine & Chu, Chengbin, 2009. "The endoscopy scheduling problem: A case study with two specialised operating rooms," International Journal of Production Economics, Elsevier, vol. 120(2), pages 452-462, August.
    12. Gartner, Daniel & Kolisch, Rainer, 2014. "Scheduling the hospital-wide flow of elective patients," European Journal of Operational Research, Elsevier, vol. 233(3), pages 689-699.
    13. Lamiri, Mehdi & Grimaud, Frédéric & Xie, Xiaolan, 2009. "Optimization methods for a stochastic surgery planning problem," International Journal of Production Economics, Elsevier, vol. 120(2), pages 400-410, August.
    14. Aisha Tayyab & Saif Ullah & Mohammed Fazle Baki, 2023. "An Outer Approximation Method for Scheduling Elective Surgeries with Sequence Dependent Setup Times to Multiple Operating Rooms," Mathematics, MDPI, vol. 11(11), pages 1-15, May.
    15. Roshanaei, Vahid & Booth, Kyle E.C. & Aleman, Dionne M. & Urbach, David R. & Beck, J. Christopher, 2020. "Branch-and-check methods for multi-level operating room planning and scheduling," International Journal of Production Economics, Elsevier, vol. 220(C).
    16. Riise, Atle & Mannino, Carlo & Lamorgese, Leonardo, 2016. "Recursive logic-based Benders’ decomposition for multi-mode outpatient scheduling," European Journal of Operational Research, Elsevier, vol. 255(3), pages 719-728.
    17. Michael Samudra & Carla Van Riet & Erik Demeulemeester & Brecht Cardoen & Nancy Vansteenkiste & Frank E. Rademakers, 2016. "Scheduling operating rooms: achievements, challenges and pitfalls," Journal of Scheduling, Springer, vol. 19(5), pages 493-525, October.
    18. C Beyrouthy & E K Burke & D Landa-Silva & B McCollum & P McMullan & A J Parkes, 2009. "Towards improving the utilization of university teaching space," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 130-143, January.
    19. Oliver Czibula & Hanyu Gu & Aaron Russell & Yakov Zinder, 2017. "A multi-stage IP-based heuristic for class timetabling and trainer rostering," Annals of Operations Research, Springer, vol. 252(2), pages 305-333, May.
    20. Dimopoulou, M. & Miliotis, P., 2001. "Implementation of a university course and examination timetabling system," European Journal of Operational Research, Elsevier, vol. 130(1), pages 202-213, April.
    21. Dobrzykowski, David & Saboori Deilami, Vafa & Hong, Paul & Kim, Seung-Chul, 2014. "A structured analysis of operations and supply chain management research in healthcare (1982–2011)," International Journal of Production Economics, Elsevier, vol. 147(PB), pages 514-530.
    22. Roshanaei, Vahid & Luong, Curtiss & Aleman, Dionne M. & Urbach, David, 2017. "Propagating logic-based Benders’ decomposition approaches for distributed operating room scheduling," European Journal of Operational Research, Elsevier, vol. 257(2), pages 439-455.

    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:45:y:2015:i:6:p:529-542. 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.