IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v73y2022i7p1487-1498.html
   My bibliography  Save this article

Scheduling the Brazilian OR conference

Author

Listed:
  • Rubens Correia
  • Anand Subramanian
  • Teobaldo Bulhões
  • Puca Huachi V. Penna

Abstract

In this paper, we propose an efficient matheuristic approach for solving the problem of scheduling the Brazilian OR conference. The event has traditionally around 300 presentations across a period of 3 to 4 days, and building a schedule for the technical sessions is an arduous task. The developed algorithm integrates the concepts of iterated local search and simulated annealing with two mathematical programming-based procedures. The idea is to group the presentations via a clustering procedure, and handle the side constraints in a subproblem via an integer programming formulation. A set partitioning procedure is applied at the end of the algorithm to find the optimal combination of clusters found during the search. We first assess the performance of the method by comparing our results with those attained by other algorithms from the literature on two existing sets of artificial instances derived from two other conferences. Next, we executed our approach on real-life instances derived from different SBPO editions, and compared the solutions with the manual solutions, when available, or with upper bounds (we solve a maximisation problem) found by an exact algorithm from the literature. The results obtained show that the matheuristic is capable of achieving high quality solutions both on the artificial and real-life instances.

Suggested Citation

  • Rubens Correia & Anand Subramanian & Teobaldo Bulhões & Puca Huachi V. Penna, 2022. "Scheduling the Brazilian OR conference," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 73(7), pages 1487-1498, July.
    • Handle: RePEc:taf:tjorxx:v:73:y:2022:i:7:p:1487-1498
    DOI: 10.1080/01605682.2021.1915194
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2021.1915194
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2021.1915194?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.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tjorxx:v:73:y:2022:i:7:p:1487-1498. 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.

    We have no bibliographic references for this item. You can help adding them by using 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.