IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i21p3976-d953958.html
   My bibliography  Save this article

A Track-Based Conference Scheduling Problem

Author

Listed:
  • Fabian Riquelme

    (Departamento de Informática, Universidad Técnica Federico Santa María, Valparaíso 2390123, Chile)

  • Elizabeth Montero

    (Facultad de Ingeniería, Universidad Andres Bello, Viña del Mar 2531015, Chile)

  • Leslie Pérez-Cáceres

    (Escuela de Ingeniería Informática, Pontificia Universidad Católica de Valparaíso, Valparaíso 2362807, Chile)

  • Nicolás Rojas-Morales

    (Departamento de Informática, Universidad Técnica Federico Santa María, Valparaíso 2390123, Chile)

Abstract

The scheduling of conferences is a challenging task that aims at creating successful conference programs that fulfill an often wide variety of requirements. In this work, we focus on the problem of generating conference programs that organize talks into tracks: subevents within the conference that are group-related talks. The main contributions of this work can be organized into three scopes: literature review, problem formulation and benchmarking, and heuristic approach. We provide a literature review of conference scheduling approaches that organizes these approaches within a timetabling problem taxonomy. We also describe the main characteristics of the conference scheduling approaches in the literature and propose a classification scheme for such works. To study the scheduling of conferences that include tracks, we introduce the definition of the track-based conference scheduling problem, a new problem that incorporates tracks in the conference program. We provide a binary integer linear programming model formulation for this problem. Our formulation considers the availability of presenters, chairs, and organizers, the avoidance of parallel tracks, and best paper sessions, among other classical constraints of conference scheduling problems. Additionally, based on our formulation, we propose a simple instance-generation procedure that we apply to generate a set of artificial instances. We complete our work by proposing a heuristic method based on the simulated annealing metaheuristic for solving the track-based conference scheduling problem. We compare the results obtained by our heuristic approach and the Gurobi solver regarding execution time and solution quality. The results show that the proposed heuristic method is a practical approach for tackling the problem as it obtains solutions in a fraction of the time required by Gurobi, while Gurobi is also unable to obtain an optimal solution in the defined time for a subset of the instances. Finally, from a general perspective, this work provides a new conference scheduling problem formulation that can be extended in the future to include other features common in conference programs. Moreover, thanks to the instance generation procedure, this formulation can be used as a benchmark for designing and comparing new solving approaches.

Suggested Citation

  • 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.
  • Handle: RePEc:gam:jmathe:v:10:y:2022:i:21:p:3976-:d:953958
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/21/3976/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/10/21/3976/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Schonberger, J. & Mattfeld, D. C. & Kopfer, H., 2004. "Memetic Algorithm timetabling for non-commercial sport leagues," European Journal of Operational Research, Elsevier, vol. 153(1), pages 102-116, February.
    2. Vincent F. Yu & Winarno & Achmad Maulidin & A. A. N. Perwira Redi & Shih-Wei Lin & Chao-Lung Yang, 2021. "Simulated Annealing with Restart Strategy for the Path Cover Problem with Time Windows," Mathematics, MDPI, vol. 9(14), pages 1-22, July.
    3. Ibrahim Attiya & Laith Abualigah & Samah Alshathri & Doaa Elsadek & Mohamed Abd Elaziz, 2022. "Dynamic Jellyfish Search Algorithm Based on Simulated Annealing and Disruption Operators for Global Optimization with Applications to Cloud Task Scheduling," Mathematics, MDPI, vol. 10(11), pages 1-23, June.
    4. Francisco Yuraszeck & Gonzalo Mejía & Jordi Pereira & Mariona Vilà, 2022. "A Novel Constraint Programming Decomposition Approach for the Total Flow Time Fixed Group Shop Scheduling Problem," Mathematics, MDPI, vol. 10(3), pages 1-26, January.
    5. Hankun Zhang & Borut Buchmeister & Xueyan Li & Robert Ojstersek, 2021. "Advanced Metaheuristic Method for Decision-Making in a Dynamic Job Shop Scheduling Environment," Mathematics, MDPI, vol. 9(8), pages 1-22, April.
    6. Oscar Chávez-Bosquez & José Hernández-Torruco & Betania Hernández-Ocaña & Juana Canul-Reich, 2020. "Modeling and Solving a Latin American University Course Timetabling Problem Instance," Mathematics, MDPI, vol. 8(10), pages 1-29, October.
    7. Stidsen, Thomas & Pisinger, David & Vigo, Daniele, 2018. "Scheduling EURO-k conferences," European Journal of Operational Research, Elsevier, vol. 270(3), pages 1138-1147.
    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. Antonin Ponsich & Bruno Domenech & Mariona Vilà, 2023. "Preface to the Special Issue “Mathematical Optimization and Evolutionary Algorithms with Applications”," Mathematics, MDPI, vol. 11(10), pages 1-6, May.
    2. David Van Bulck & Dries Goossens & Jo¨rn Scho¨nberger & Mario Guajardo, 2020. "An Instance Data Repository for the Round-robin Sports Timetabling Problem," Management and Labour Studies, XLRI Jamshedpur, School of Business Management & Human Resources, vol. 45(2), pages 184-200, May.
    3. Schönberger, Jörn, 2015. "Scheduling of Sport League Systems with Inter-League Constraints," Discussion Papers 2/2015, Technische Universität Dresden, "Friedrich List" Faculty of Transport and Traffic Sciences, Institute of Transport and Economics.
    4. Simona Mancini, 2018. "Assignment of swimmers to events in a multi-team meeting for team global performance optimization," Annals of Operations Research, Springer, vol. 264(1), pages 325-337, May.
    5. 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.
    6. Knust, Sigrid, 2010. "Scheduling non-professional table-tennis leagues," European Journal of Operational Research, Elsevier, vol. 200(2), pages 358-367, January.
    7. Mancini Simona & Isabello Andrea, 2014. "Fair referee assignment for the Italian soccer serieA," Journal of Quantitative Analysis in Sports, De Gruyter, vol. 10(2), pages 153-160, June.
    8. Angelos Dimitsas & Christos Gogos, 2024. "Finding Near Optimal Solutions to the Thesis Defense Timetabling Problem by Exploiting Symmetries," SN Operations Research Forum, Springer, vol. 5(3), pages 1-19, September.
    9. Ceschia, Sara & Di Gaspero, Luca & Schaerf, Andrea, 2023. "Educational timetabling: Problems, benchmarks, and state-of-the-art results," European Journal of Operational Research, Elsevier, vol. 308(1), pages 1-18.
    10. Du, Yu & Li, Jun-qing, 2024. "A deep reinforcement learning based algorithm for a distributed precast concrete production scheduling," International Journal of Production Economics, Elsevier, vol. 268(C).
    11. David Bulck & Dries R. Goossens & Frits C. R. Spieksma, 2019. "Scheduling a non-professional indoor football league: a tabu search based approach," Annals of Operations Research, Springer, vol. 275(2), pages 715-730, April.
    12. M B Wright, 2007. "Case study: problem formulation and solution for a real-world sports scheduling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(4), pages 439-445, April.
    13. M B Wright, 2009. "50 years of OR in sport," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 161-168, May.
    14. 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.
    15. Pylyavskyy, Yaroslav & Jacko, Peter & Kheiri, Ahmed, 2024. "A generic approach to conference scheduling with integer programming," European Journal of Operational Research, Elsevier, vol. 317(2), pages 487-499.
    16. David Van Bulck & Dries Goossens, 2022. "Optimizing rest times and differences in games played: an iterative two-phase approach," Journal of Scheduling, Springer, vol. 25(3), pages 261-271, June.
    17. A Ghoniem & H D Sherali, 2010. "Models and algorithms for the scheduling of a doubles tennis training tournament," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(5), pages 723-731, May.
    18. Xiajie Yi & Dries Goossens, 2023. "Strategies for dealing with uncertainty in time-relaxed sports timetabling," Annals of Operations Research, Springer, vol. 320(1), pages 473-492, January.
    19. Hankun Zhang & Borut Buchmeister & Xueyan Li & Robert Ojstersek, 2023. "An Efficient Metaheuristic Algorithm for Job Shop Scheduling in a Dynamic Environment," Mathematics, MDPI, vol. 11(10), pages 1-24, May.
    20. Vincent F. Yu & Hadi Susanto & Yu-Hsuan Yeh & Shih-Wei Lin & Yu-Tsung Huang, 2022. "The Vehicle Routing Problem with Simultaneous Pickup and Delivery and Parcel Lockers," Mathematics, MDPI, vol. 10(6), pages 1-22, March.

    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:gam:jmathe:v:10:y:2022:i:21:p:3976-:d:953958. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.