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

The University of Toronto’s Rotman School of Management Uses Management Science to Create MBA Study Groups

Author

Listed:
  • Dmitry Krass

    (Joseph L. Rotman School of Management, University of Toronto, 105 St. George Street, Toronto, Ontario, Canada M5S 3E6)

  • Anton Ovchinnikov

    (Joseph L. Rotman School of Management, University of Toronto, 105 St. George Street, Toronto, Ontario, Canada M5S 3E6)

Abstract

Business schools look for ways to teach MBA graduates effective group work skills, generally through group-based assignments and projects. However, if not monitored carefully, group work can undermine the learning process; group composition is important. The Rotman School has developed a multiple-well-balanced-study-groups strategy to ensure that students are assigned to several balanced and nonoverlapping groups, which are used in different courses. We formulated the group-creation problem as a mathematical optimization model and implemented it in a user-friendly software package that Rotman MBA office administrators use to create student groups. Switching to computer-generated groups produced better balanced groups, saved much manual effort, and increased levels of satisfaction among students, faculty, and the MBA office personnel.

Suggested Citation

  • Dmitry Krass & Anton Ovchinnikov, 2006. "The University of Toronto’s Rotman School of Management Uses Management Science to Create MBA Study Groups," Interfaces, INFORMS, vol. 36(2), pages 126-137, April.
    • Handle: RePEc:inm:orinte:v:36:y:2006:i:2:p:126-137
    DOI: 10.1287/inte.1050.0194
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.1050.0194
    Download Restriction: no
    File URL: https://libkey.io/10.1287/inte.1050.0194?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. K R Baker & S G Powell, 2002. "Methods for assigning students to groups: a study of alternative objective functions," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(4), pages 397-404, April.
    2. B M Baker & C Benn, 2001. "Assigning pupils to tutor groups in a comprehensive school," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(6), pages 623-629, June.
    3. J Desrosiers & N Mladenović & D Villeneuve, 2005. "Design of balanced MBA student teams," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(1), pages 60-66, January.
    4. Bhadury, Joyendu & Mighty, E. Joy & Damar, Hario, 2000. "Maximizing workforce diversity in project teams: a network flow approach," Omega, Elsevier, vol. 28(2), pages 143-153, April.
    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. Arne Schulz, 2023. "The balanced maximally diverse grouping problem with integer attribute values," Journal of Combinatorial Optimization, Springer, vol. 45(5), pages 1-27, July.
    2. Stephen Mahar & Wayne Winston & P. Daniel Wright, 2013. "Eli Lilly and Company Uses Integer Programming to Form Volunteer Teams in Impoverished Countries," Interfaces, INFORMS, vol. 43(3), pages 268-284, May-June.
    3. Theresa M. Roeder & Robert M. Saltzman, 2014. "Schedule-Based Group Assignment Using Constraint Programming," INFORMS Transactions on Education, INFORMS, vol. 14(2), pages 63-72, February.
    4. Anton Ovchinnikov & Joseph Milner, 2008. "Spreadsheet Model Helps to Assign Medical Residents at the University of Vermont's College of Medicine," Interfaces, INFORMS, vol. 38(4), pages 311-323, August.
    5. Krass, Dmitry & Ovchinnikov, Anton, 2010. "Constrained group balancing: Why does it work," European Journal of Operational Research, Elsevier, vol. 206(1), pages 144-154, October.
    6. Nahid Rezaeinia & Julio César Góez & Mario Guajardo, 2022. "Efficiency and fairness criteria in the assignment of students to projects," Annals of Operations Research, Springer, vol. 319(2), pages 1717-1735, December.
    7. Arne Schulz, 2022. "A new mixed-integer programming formulation for the maximally diverse grouping problem with attribute values," Annals of Operations Research, Springer, vol. 318(1), pages 501-530, November.
    8. Fernández, Elena & Kalcsics, Jörg & Nickel, Stefan, 2013. "The maximum dispersion problem," Omega, Elsevier, vol. 41(4), pages 721-730.
    9. Binyamin Krauss & Jon Lee & Daniel Newman, 2013. "Optimizing the Assignment of Students to Classes in an Elementary School," INFORMS Transactions on Education, INFORMS, vol. 14(1), pages 39-44, September.
    10. Andrew Bowers & Melissa R. Bowers & Nana Bryan & Paolo Letizia & Spencer Murphy, 2023. "Forming Student Teams to Incorporate Soft Skills and Commonality of Schedule," Interfaces, INFORMS, vol. 53(2), pages 111-127, March.

    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. Z P Fan & Y Chen & J Ma & S Zeng, 2011. "Erratum: A hybrid genetic algorithmic approach to the maximally diverse grouping problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(7), pages 1423-1430, July.
    2. Z P Fan & Y Chen & J Ma & S Zeng, 2011. "A hybrid genetic algorithmic approach to the maximally diverse grouping problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(1), pages 92-99, January.
    3. Sergio García & Valentina Cacchiani & Lieselot Vanhaverbeke & Martin Bischoff, 2014. "The table placement problem: a research challenge at the EWI 2007," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(1), pages 208-226, April.
    4. Theresa M. Roeder & Robert M. Saltzman, 2014. "Schedule-Based Group Assignment Using Constraint Programming," INFORMS Transactions on Education, INFORMS, vol. 14(2), pages 63-72, February.
    5. Kayse Lee Maass & Vera Mann Hey Lo & Anna Weiss & Mark S. Daskin, 2015. "Maximizing Diversity in the Engineering Global Leadership Cultural Families," Interfaces, INFORMS, vol. 45(4), pages 293-304, August.
    6. J Desrosiers & N Mladenović & D Villeneuve, 2005. "Design of balanced MBA student teams," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(1), pages 60-66, January.
    7. Krass, Dmitry & Ovchinnikov, Anton, 2010. "Constrained group balancing: Why does it work," European Journal of Operational Research, Elsevier, vol. 206(1), pages 144-154, October.
    8. Andrew Bowers & Melissa R. Bowers & Nana Bryan & Paolo Letizia & Spencer Murphy, 2023. "Forming Student Teams to Incorporate Soft Skills and Commonality of Schedule," Interfaces, INFORMS, vol. 53(2), pages 111-127, March.
    9. Yang, Xiao & Cai, Zonghui & Jin, Ting & Tang, Zheng & Gao, Shangce, 2022. "A three-phase search approach with dynamic population size for solving the maximally diverse grouping problem," European Journal of Operational Research, Elsevier, vol. 302(3), pages 925-953.
    10. Rex Cutshall & Srinagesh Gavirneni & Kenneth Schultz, 2007. "Indiana University’s Kelley School of Business Uses Integer Programming to Form Equitable, Cohesive Student Teams," Interfaces, INFORMS, vol. 37(3), pages 265-276, June.
    11. 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.
    12. Arne Schulz, 2023. "The balanced maximally diverse grouping problem with integer attribute values," Journal of Combinatorial Optimization, Springer, vol. 45(5), pages 1-27, July.
    13. Gusev, Vasily V., 2020. "The vertex cover game: Application to transport networks," Omega, Elsevier, vol. 97(C).
    14. Perla, Abhinav & Nikolaev, Alexander & Pasiliao, Eduardo, 2018. "Workforce management under social Link Based Corruption," Omega, Elsevier, vol. 78(C), pages 222-236.
    15. Hsiang-Hsi Liu & Teng-Kun Wang & Guan-Ting Liu, 2020. "Workforce Diversity Affecting on the Non-financial Performance of Taiwanese Multinational Enterprises under Different Environmental Factors: CEOs' Viewpoints," Advances in Management and Applied Economics, SCIENPRESS Ltd, vol. 10(4), pages 1-7.
    16. Johnes, Jill, 2015. "Operational Research in education," European Journal of Operational Research, Elsevier, vol. 243(3), pages 683-696.
    17. Amina Lamghari & Jacques Ferland, 2010. "Metaheuristic methods based on Tabu search for assigning judges to competitions," Annals of Operations Research, Springer, vol. 180(1), pages 33-61, November.
    18. Gliesch, Alex & Ritt, Marcus, 2021. "A hybrid heuristic for the maximum dispersion problem," European Journal of Operational Research, Elsevier, vol. 288(3), pages 721-735.
    19. Lai, Xiangjing & Hao, Jin-Kao, 2016. "Iterated maxima search for the maximally diverse grouping problem," European Journal of Operational Research, Elsevier, vol. 254(3), pages 780-800.
    20. Arne Schulz, 2022. "A new mixed-integer programming formulation for the maximally diverse grouping problem with attribute values," Annals of Operations Research, Springer, vol. 318(1), pages 501-530, November.

    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:36:y:2006:i:2:p:126-137. 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.