An empirical comparison of heuristic methods for creating maximally diverse groups

Journal of the Operational Research Society

Volumn 49, Issue 6, 1998, Pages 635-646

  Weitz, R R ^a   Lakshminarayanan, S ^b  

^a SETON HALL UNIVERSITY   (United States)

^b MinMax Consulting   (United States)

Author keywords

Allocation; Education; Heuristics; Maximal diversity; Timetabling

Indexed keywords

OPERATIONS RESEARCH; RESOURCE ALLOCATION; SCHEDULING;

MAXIMALLY DIVERSE GROUPS;

HEURISTIC METHODS;

EID: 0032094794     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600510     Document Type: Article

References (22)

1. Feo T and Khellaf M (1990). A class of bounded approximation algorithms for graph partitioning. Networks 20: 181-195.
2. Lakshminarayanan S and Weitz R (1994). Creating groups of maximum diversity: contrasting math programming and heuristic approaches, working paper, Stillman School of Business, Seton Hall University, South Orange, NJ 07079 (revised January 1996).
3. Weitz RR and Jelassi MT (1992). Assigning students to groups: a multi-criteria decision support system approach. Dec Sci 23: 746-757.
4. Mingers J and O’Brien FA (1995). Creating student groups with similar characteristics: a heuristic approach. Omega 23: 313-321.
5. O.Brien FA and Mingers J (1995). The equitable partitioning problem: a heuristic algorithm applied to the allocation of university student accommodation. Warwick Business School Research Paper, no. 187.
6. Lotfi V and Cerveny R (1991). A final exam scheduling package. J Opl Res Soc 42: 205-216.
7. Arani T and Lotfi V (1989). A three phased approach to final exam scheduling. IIE Trans 21: 86-96.
8. Feo T, Goldschmidt O and Khellaf M (1992). One-half approximation algorithms for the k-partition problem. Opns Res 40 (Supp 1): S170-S173.
9. Weitz R and Lakshminarayanan S (1996). An empirical comparison of graph theoretic and heuristic methods for creating maximally diverse groups, working paper. Stillman School of Business, Seton Hall University, South Orange, NJ 07079, March.
10. Kuo CC, Glover F and Dhir KS (1993). Analyzing and modeling the maximum diversity problem by zero-one programming. Dec Sci 24: 1171-1185.
11. Hill AV, Naumann JD and Chervany NL (1983). SCAT and SPAT: large-scale computer based optimization systems for the personnel assignment problem. Dec Sci 14: 207-220.
12. Reeves GR and Hickman EP (1992). Assigning MBA students to field study project teams: a multicriteria approach. Interfaces 22(5): 52-58.
13. Mijaji I, Ohno K and Mine H (1987). Solution method for partitioning students into groups. Eur J Opl Res 33: 82-90.
14. Beheshtian-Ardekani M and Mahmood MA (1986). Development and validation of a tool for assigning students to groups for class projects. Dec Sci 17: 92-113.
15. Muller T (1989). Assigning students to groups for class projects: an exploratory test of two methods. Dec Sci 20: 623-634.
16. Donahue JM and Fox JB (1993). An investigation into the people-sequential heuristic method of group formation. Dec Sci 24: 493-508.
17. Singh N (1993). Design of cellular manufacturing systems: an invited review. Eur J Opl Res 69: 284-291.
18. Weitz R and Lakshminarayanan S (1996). On a heuristic for the final exam scheduling problem. J Opl Res Soc 47: 599-600.
19. Carpaneto G and Toh P (1980). ACM Trans Math Software 6: 104-111. (The program, ASSCT: a Fortran subroutine for solving the square assignment problem, is available via the internet at http://math.nist.gov/cgi-bin/gams-serve/list-module-components/TOMS/548/8587.html).
20. Weitz R and Lakshminarayanan S (1996). An empirical comparison of heuristic methods for creating maximally diverse groups, working paper. Stillman School of Business, Seton Hall Univerity, South Orange, NJ 07079, January.
21. Byrne JA and Bongiomo L (1994). The best B schools. Bus Week October 24.
22. Weitz R and Lakshminarayanan S (1997). An empirical comparison of heuristic and graph theoretic methods for creating maximally diverse groups, VLSI design, and exam scheduling. Omega 25: 473-482.