IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v297y2022i1p15-26.html
   My bibliography  Save this article

Conference scheduling: A clustering-based approach

Author

Listed:
  • Bulhões, Teobaldo
  • Correia, Rubens
  • Subramanian, Anand

Abstract

Scheduling the technical sessions of scientific events is an arduous task commonly faced by many organizers worldwide. Due the particularities of each conference, there is no consensus regarding the problem definition, and researchers have tackled each specific case individually. Despite their distinct characteristics, one often expects the sessions to be composed of presentations of similar scope. This natural assumption led us to define a basic yet sufficiently general version of the problem that aims at maximizing the benefit of clustering papers with common topics in the same session, while leaving the particularities of the event to be addressed by means of side constraints. Three mathematical formulations based on integer linear programming are proposed for the problem, which in turn is shown to be NP-hard. The first model consists of a compact formulation, whereas the second and third models serve as underlying formulations for branch-and-cut (BC) and branch-cut-and-price (BCP) algorithms, respectively. Computational experiments were carried out on real-life and artificial instances derived from two conferences, considering several scenarios. While the compact formulation and the BC procedure could solve instances with moderate size, the BCP approach managed to produce tight bounds for instances with up to 163 presentations.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:297:y:2022:i:1:p:15-26
    DOI: 10.1016/j.ejor.2021.04.042
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221721003775
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2021.04.042?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. Teobaldo Bulhões & Anand Subramanian & Gilberto F. Sousa Filho & Lucídio dos Anjos F. Cabral, 2017. "Branch-and-price for p-cluster editing," Computational Optimization and Applications, Springer, vol. 67(2), pages 293-316, June.
    4. Stidsen, Thomas & Pisinger, David & Vigo, Daniele, 2018. "Scheduling EURO-k conferences," European Journal of Operational Research, Elsevier, vol. 270(3), pages 1138-1147.
    5. 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.
    6. A. Pessoa & R. Sadykov & E. Uchoa & F. Vanderbeck, 2018. "Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation," INFORMS Journal on Computing, INFORMS, vol. 30(2), pages 339-360, May.
    7. 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.
    8. 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.
    9. Alain Billionnet & Éric Soutif, 2004. "Using a Mixed Integer Programming Tool for Solving the 0–1 Quadratic Knapsack Problem," INFORMS Journal on Computing, INFORMS, vol. 16(2), pages 188-197, May.
    10. Lucas Bastos & Luiz Satoru Ochi & Fábio Protti & Anand Subramanian & Ivan César Martins & Rian Gabriel S. Pinheiro, 2016. "Efficient algorithms for cluster editing," Journal of Combinatorial Optimization, Springer, vol. 31(1), pages 347-371, January.
    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. 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.
    2. Teobaldo Bulhões & Anand Subramanian & Gilberto F. Sousa Filho & Lucídio dos Anjos F. Cabral, 2017. "Branch-and-price for p-cluster editing," Computational Optimization and Applications, Springer, vol. 67(2), pages 293-316, June.
    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. Griset, Rodolphe & Bendotti, Pascale & Detienne, Boris & Porcheron, Marc & Şen, Halil & Vanderbeck, François, 2022. "Combining Dantzig-Wolfe and Benders decompositions to solve a large-scale nuclear outage planning problem," European Journal of Operational Research, Elsevier, vol. 298(3), pages 1067-1083.
    6. Renaud Chicoisne, 2023. "Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes," Computational Optimization and Applications, Springer, vol. 84(3), pages 789-831, April.
    7. Artur Alves Pessoa & Teobaldo Bulhões & Vitor Nesello & Anand Subramanian, 2022. "Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1512-1530, May.
    8. Ruslan Sadykov & François Vanderbeck & Artur Pessoa & Issam Tahiri & Eduardo Uchoa, 2019. "Primal Heuristics for Branch and Price: The Assets of Diving Methods," INFORMS Journal on Computing, INFORMS, vol. 31(2), pages 251-267, April.
    9. Orlando Rivera Letelier & François Clautiaux & Ruslan Sadykov, 2022. "Bin Packing Problem with Time Lags," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 2249-2270, July.
    10. Fabian Riquelme & Elizabeth Montero & Leslie Pérez-Cáceres & Nicolás Rojas-Morales, 2022. "A Track-Based Conference Scheduling Problem," Mathematics, MDPI, vol. 10(21), pages 1-25, October.
    11. Saharnaz Mehrani & Carlos Cardonha & David Bergman, 2022. "Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 1070-1085, March.
    12. Teobaldo Bulhões & Ruslan Sadykov & Anand Subramanian & Eduardo Uchoa, 2020. "On the exact solution of a large class of parallel machine scheduling problems," Journal of Scheduling, Springer, vol. 23(4), pages 411-429, August.
    13. Flores-Quiroz, Angela & Strunz, Kai, 2021. "A distributed computing framework for multi-stage stochastic planning of renewable power systems with energy storage as flexibility option," Applied Energy, Elsevier, vol. 291(C).
    14. Zeynep Ertem & Eugene Lykhovyd & Yiming Wang & Sergiy Butenko, 2020. "The maximum independent union of cliques problem: complexity and exact approaches," Journal of Global Optimization, Springer, vol. 76(3), pages 545-562, March.
    15. Artur Pessoa & Ruslan Sadykov & Eduardo Uchoa, 2021. "Solving Bin Packing Problems Using VRPSolver Models," SN Operations Research Forum, Springer, vol. 2(2), pages 1-25, June.
    16. Artur Alves Pessoa & Michael Poss & Ruslan Sadykov & François Vanderbeck, 2021. "Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty," Operations Research, INFORMS, vol. 69(3), pages 739-754, May.
    17. 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.
    18. Thays A. Oliveira & Yuri B. Gabrich & Helena Ramalhinho & Miquel Oliver & Miri W. Cohen & Luiz S. Ochi & Serigne Gueye & Fábio Protti & Alysson A. Pinto & Diógenes V. M. Ferreira & Igor M. Coelho & Vi, 2020. "Mobility, Citizens, Innovation and Technology in Digital and Smart Cities," Future Internet, MDPI, vol. 12(2), pages 1-27, January.
    19. Banda, Juan & Velasco, Jonás & Berrones, Arturo, 2017. "Dual mean field search for large scale linear and quadratic knapsack problems," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 478(C), pages 158-167.
    20. François Clautiaux & Ruslan Sadykov & François Vanderbeck & Quentin Viaud, 2019. "Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 7(3), pages 265-297, September.

    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:ejores:v:297:y:2022:i:1:p:15-26. 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/locate/eor .

    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.