IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v23y1995i3p313-321.html
   My bibliography  Save this article

Creating student groups with similar characteristics: A heuristic approach

Author

Listed:
  • Mingers, J.
  • O'Brien, F. A.

Abstract

This paper describes an algorithm for classifying elements with binary valued attributes so that the classes are similar. The problem chosen for discussing is that of allocating students to groups within an educational setting. Individual students are described by a set of binary-valued attributes. The objective of the algorithm is to create working groups which are similar to each other in terms of their mix of student attributes. The algorithm uses an information theory measure. The paper also compares the performance of the algorithm to a goal programming formulation of the problem.

Suggested Citation

  • Mingers, J. & O'Brien, F. A., 1995. "Creating student groups with similar characteristics: A heuristic approach," Omega, Elsevier, vol. 23(3), pages 313-321, June.
    • Handle: RePEc:eee:jomega:v:23:y:1995:i:3:p:313-321
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0305-0483(95)00014-F
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Iszan Hana Kaharudin & Mohammad Syuhaimi Ab-Rahman & Roslan Abd-Shukor & Azamin Zaharim & Mohd Jailani Mohd Nor & Ahmad Kamal Ariffin Mohd Ihsan & Shahrom Md Zain & Afiq Hipni & Kamisah Osman & Ruszym, 2022. "How Does Supervision Technique Affect Research? Towards Sustainable Performance: Publications and Students from Pure and Social Sciences," Sustainability, MDPI, vol. 14(9), pages 1-18, May.
    2. Schulz, Arne, 2021. "The balanced maximally diverse grouping problem with block constraints," European Journal of Operational Research, Elsevier, vol. 294(1), pages 42-53.
    3. Şenay Ağca & Burak Eksioglu & Jay B. Ghosh, 2000. "Lagrangian solution of maximum dispersion problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(2), pages 97-114, March.
    4. 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.
    5. Mustafa, A. & Goh, M., 1996. "Multi-criterion models for higher education administration," Omega, Elsevier, vol. 24(2), pages 167-178, April.
    6. 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.
    7. Sara Mohamed Abdelaziz El-Menawy & Pancie Salah Saleh, 2023. "How does the mediating role of the use of social media platforms foster the relationship between employer attractiveness and generation Z intentions to apply for a job?," Future Business Journal, Springer, vol. 9(1), pages 1-13, December.
    8. 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.
    9. Saber, Hussein M. & Ghosh, Jay B., 2001. "Assigning students to academic majors," Omega, Elsevier, vol. 29(6), pages 513-523, December.
    10. Stewart Robinson & Maureen Meadows & John Mingers & Frances A. O'Brien & Estelle A. Shale & Stephanie Stray, 2003. "Teaching OR/MS to MBAs at Warwick Business School: A Turnaround Story," Interfaces, INFORMS, vol. 33(2), pages 67-76, April.
    11. O'Brien, F. A. & Mingers, J., 1997. "A heuristic algorithm for the equitable partitioning problem," Omega, Elsevier, vol. 25(2), pages 215-223, April.
    12. Weitz, R. R. & Lakshminarayanan, S., 1997. "An empirical comparison of heuristic and graph theoretic methods for creating maximally diverse groups, VLSI design, and exam scheduling," Omega, Elsevier, vol. 25(4), pages 473-482, August.
    13. 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.
    14. Kondor, Gábor, 2022. "Egyoldali párosítási piacok nehézségi eredményei magasabb dimenzióban [Hardness results of one-sided matching markets in higher dimensions]," Közgazdasági Szemle (Economic Review - monthly of the Hungarian Academy of Sciences), Közgazdasági Szemle Alapítvány (Economic Review Foundation), vol. 0(7), pages 825-840.

    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:jomega:v:23:y:1995:i:3:p:313-321. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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.