IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v81y2018icp38-47.html
   My bibliography  Save this article

Conference scheduling — A personalized approach

Author

Listed:
  • Vangerven, Bart
  • Ficker, Annette M.C.
  • Goossens, Dries R.
  • Passchyn, Ward
  • Spieksma, Frits C.R.
  • Woeginger, Gerhard J.

Abstract

Scientific conferences have become an essential part of academic research and require significant investments (e.g. time and money) from their participants. It falls upon the organizers to develop a schedule that allows the participants to attend the talks of their interest. We present a combined approach of assigning talks to rooms and time slots, grouping talks into sessions, and deciding on an optimal itinerary for each participant. Our goal is to maximize attendance, taking into account the common practice of session hopping. On a secondary level, we accommodate presenters’ availabilities. We use a hierarchical optimization approach, sequentially solving integer programming models, which has been applied to construct the schedule of the MathSport (2013), MAPSP (2015 and 2017) and ORBEL (2017) conferences.

Suggested Citation

  • Vangerven, Bart & Ficker, Annette M.C. & Goossens, Dries R. & Passchyn, Ward & Spieksma, Frits C.R. & Woeginger, Gerhard J., 2018. "Conference scheduling — A personalized approach," Omega, Elsevier, vol. 81(C), pages 38-47.
    • Handle: RePEc:eee:jomega:v:81:y:2018:i:c:p:38-47
    DOI: 10.1016/j.omega.2017.09.007
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048317302013
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.omega.2017.09.007?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Potthoff, Richard F & Munger, Michael C, 2003. "Use of Integer Programming to Optimize the Scheduling of Panels at Annual Meetings of the Public Choice Society," Public Choice, Springer, vol. 117(1-2), pages 163-175, October.
    2. Scott E. Sampson & Elliott N. Weiss, 1995. "Increasing Service Levels in Conference and Educational Scheduling: A Heuristic Approach," Management Science, INFORMS, vol. 41(11), pages 1816-1825, November.
    3. M G Nicholls, 2007. "A small-to-medium-sized conference scheduling heuristic incorporating presenter and limited attendee preferences," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(3), pages 301-308, March.
    4. David Grémillet, 2008. "Paradox of flying to meetings to protect the environment," Nature, Nature, vol. 455(7217), pages 1175-1175, October.
    5. Yingping Huang & Xihui Zhang & Paulette S. Alexander, 2012. "A Heuristic Algorithm for Optimizing Business Matchmaking Scheduling," International Journal of Operations Research and Information Systems (IJORIS), IGI Global, vol. 3(4), pages 59-73, October.
    6. Richard Potthoff & Steven Brams, 2007. "Scheduling of panels by integer programming: Results for the 2005 and 2006 New Orleans meetings," Public Choice, Springer, vol. 131(3), pages 465-468, June.
    7. A. T. Ernst & R. G. J. Mills & P. Welgama, 2003. "Scheduling Appointments at Trade Events for the Australian Tourist Commission," Interfaces, INFORMS, vol. 33(3), pages 12-23, June.
    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. Christian Ackermann & Felix Hahne & Julia Rieck, 2022. "Matching and Scheduling of Student-Company-Talks for a University IT-Speed Dating Event," SN Operations Research Forum, Springer, vol. 3(3), pages 1-29, September.
    2. Bulhões, Teobaldo & Correia, Rubens & Subramanian, Anand, 2022. "Conference scheduling: A clustering-based approach," European Journal of Operational Research, Elsevier, vol. 297(1), pages 15-26.

    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. Bulhões, Teobaldo & Correia, Rubens & Subramanian, Anand, 2022. "Conference scheduling: A clustering-based approach," European Journal of Operational Research, Elsevier, vol. 297(1), pages 15-26.
    2. Braathen, Christian, 2022. "Interview Scheduling: An Integer Programming Approach," Discussion Papers 2022/10, Norwegian School of Economics, Department of Business and Management Science.
    3. Akkan, Can & Erdem Külünk, M. & Koçaş, Cenk, 2016. "Finding robust timetables for project presentations of student teams," European Journal of Operational Research, Elsevier, vol. 249(2), pages 560-576.
    4. Scott E. Sampson, 2008. "OR PRACTICE---Optimization of Vacation Timeshare Scheduling," Operations Research, INFORMS, vol. 56(5), pages 1079-1088, October.
    5. Andrew G. Clark & Susan Cholette & Ozgur Ozluk, 2011. "UCSF Increases Consumer Value Through Optimal Vendor-Show Scheduling," Interfaces, INFORMS, vol. 41(4), pages 327-337, August.
    6. K A Willoughby & C J Zappe, 2006. "A methodology to optimize foundation seminar assignments," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(8), pages 950-956, August.
    7. Melissa Nursey-Bray & Robert Palmer & Bridie Meyer-Mclean & Thomas Wanner & Cris Birzer, 2019. "The Fear of Not Flying: Achieving Sustainable Academic Plane Travel in Higher Education Based on Insights from South Australia," Sustainability, MDPI, vol. 11(9), pages 1-22, May.
    8. Aparupa Das Gupta & Uday S. Karmarkar & Guillaume Roels, 2016. "The Design of Experiential Services with Acclimation and Memory Decay: Optimal Sequence and Duration," Management Science, INFORMS, vol. 62(5), pages 1278-1296, May.
    9. Gerardo Gonzalez & Christopher Richards & Alexandra Newman, 2018. "Optimal Course Scheduling for United States Air Force Academy Cadets," Interfaces, INFORMS, vol. 48(3), pages 217-234, June.
    10. Ahmadian, Mohammad Mahdi & Khatami, Mostafa & Salehipour, Amir & Cheng, T.C.E., 2021. "Four decades of research on the open-shop scheduling problem to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 295(2), pages 399-426.
    11. Tomáš Müller & Keith Murray, 2010. "Comprehensive approach to student sectioning," Annals of Operations Research, Springer, vol. 181(1), pages 249-269, December.

    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:eee:jomega:v:81:y:2018:i:c:p:38-47. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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.