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

Scheduling Appointments at Trade Events for the Australian Tourist Commission

Author

Listed:
  • A. T. Ernst

    (CSIRO Mathematical and Information Sciences, Private Bag 10, Clayton South MDC Vic 3169, Australia)

  • R. G. J. Mills

    (CSIRO Mathematical and Information Sciences, Private Bag 10, Clayton South MDC Vic 3169, Australia)

  • P. Welgama

    (Rio Tinto Technical Services, 1 Turner Avenue, Technology Park Bentley WA, Australia)

Abstract

Many trade events include appointments between buyers and sellers. Each buyer indicates preferences for meetings with various sellers and vice versa. We developed an assignment model and implemented it in the SATE (scheduling appointments at trade events) software. SATE maximizes an objective that weights the preferences of buyers and sellers. Our assignment method schedules more meetings with higher preferences in less computational time than the previous method used. SATE allows organizers of trade events to control appointment scheduling and investigate various scenarios prior to publishing appointment schedules.

Suggested Citation

  • 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.
    • Handle: RePEc:inm:orinte:v:33:y:2003:i:3:p:12-23
    DOI: 10.1287/inte.33.3.12.16012
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.33.3.12.16012
    Download Restriction: no
    File URL: https://libkey.io/10.1287/inte.33.3.12.16012?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. Frieze, A. M., 1983. "Complexity of a 3-dimensional assignment problem," European Journal of Operational Research, Elsevier, vol. 13(2), pages 161-164, June.
    2. Magos, D. & Miliotis, P., 1994. "An algorithm for the planar three-index assignment problem," European Journal of Operational Research, Elsevier, vol. 77(1), pages 141-153, August.
    3. John J. Bartholdi & Kevin L. McCroan, 1990. "Scheduling Interviews for a Job Fair," Operations Research, INFORMS, vol. 38(6), pages 951-960, December.
    4. Cangalovic, Mirjana & Kovacevic-Vujcic, Vera & Ivanovic, Lav & Drazic, Milan, 1998. "Modeling and solving a real-life assignment problem at universities," European Journal of Operational Research, Elsevier, vol. 110(2), pages 223-233, October.
    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. 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.
    2. 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.
    3. Braathen, Christian, 2022. "Interview Scheduling: An Integer Programming Approach," Discussion Papers 2022/10, Norwegian School of Economics, Department of Business and Management Science.
    4. 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.
    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.

    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. Yokoya, Daisuke & Duin, Cees W. & Yamada, Takeo, 2011. "A reduction approach to the repeated assignment problem," European Journal of Operational Research, Elsevier, vol. 210(2), pages 185-193, April.
    2. Loiola, Eliane Maria & de Abreu, Nair Maria Maia & Boaventura-Netto, Paulo Oswaldo & Hahn, Peter & Querido, Tania, 2007. "A survey for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 657-690, January.
    3. Braathen, Christian, 2022. "Interview Scheduling: An Integer Programming Approach," Discussion Papers 2022/10, Norwegian School of Economics, Department of Business and Management Science.
    4. Arora, Shalini & Puri, M. C., 1998. "A variant of time minimizing assignment problem," European Journal of Operational Research, Elsevier, vol. 110(2), pages 314-325, October.
    5. 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.
    6. P. Senthil Kumar, 2020. "Developing a New Approach to Solve Solid Assignment Problems Under Intuitionistic Fuzzy Environment," International Journal of Fuzzy System Applications (IJFSA), IGI Global, vol. 9(1), pages 1-34, January.
    7. Kravtsov, M.K. & Lukshin, E.V., 2008. "Polyhedral combinatorics of multi-index axial transportation problems," European Journal of Operational Research, Elsevier, vol. 189(3), pages 920-938, September.
    8. Juretzka, Jan & Böhler, Catharina & Drexl, Andreas, 2000. "Ein Decision Support System zur universitären Prüfungsplanung," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 530, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    9. Penn, M.L. & Potts, C.N. & Harper, P.R., 2017. "Multiple criteria mixed-integer programming for incorporating multiple factors into the development of master operating theatre timetables," European Journal of Operational Research, Elsevier, vol. 262(1), pages 194-206.
    10. Urban, Timothy L. & Russell, Robert A., 2003. "Scheduling sports competitions on multiple venues," European Journal of Operational Research, Elsevier, vol. 148(2), pages 302-311, July.
    11. G Appa & D Magos & I Mourtos, 2004. "A Branch & Cut algorithm for a four-index assignment problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(3), pages 298-307, March.
    12. Renata M. Aiex & Mauricio G. C. Resende & Panos M. Pardalos & Gerardo Toraldo, 2005. "GRASP with Path Relinking for Three-Index Assignment," INFORMS Journal on Computing, INFORMS, vol. 17(2), pages 224-247, May.
    13. Boštjan Gabrovšek & Tina Novak & Janez Povh & Darja Rupnik Poklukar & Janez Žerovnik, 2020. "Multiple Hungarian Method for k -Assignment Problem," Mathematics, MDPI, vol. 8(11), pages 1-18, November.
    14. P. Senthil Kumar, 2020. "Algorithms for solving the optimization problems using fuzzy and intuitionistic fuzzy set," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 11(1), pages 189-222, February.
    15. 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.
    16. Briskorn, Dirk & Drexl, Andreas & Spieksma, Frits C. R., 2005. "Round robin tournaments and three index assignment," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 604, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    17. Gimadi, Edward Kh., 2015. "Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph," Applied Mathematics and Computation, Elsevier, vol. 255(C), pages 84-91.
    18. Kim, Bum-Jin & Hightower, William L. & Hahn, Peter M. & Zhu, Yi-Rong & Sun, Lu, 2010. "Lower bounds for the axial three-index assignment problem," European Journal of Operational Research, Elsevier, vol. 202(3), pages 654-668, May.
    19. Vladyslav Sokol & Ante Ćustić & Abraham P. Punnen & Binay Bhattacharya, 2020. "Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 730-746, July.

    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:33:y:2003:i:3:p:12-23. 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.