References

Arani, T. and V. Lotfi, 1989. A three phased approach to final exam scheduling. IIE Trans., 21: 86-96.
CrossRef  |  Direct Link  |  

Baker, B.M. and C. Benn, 2001. Assigning pupils to tutor groups in a comprehensive school. J. Oper. Res. Soc., 52: 623-629.
CrossRef  |  Direct Link  |  

Falkenauer, E., 1998. Genetic Algorithms and Grouping Problems. John Wiley & Sons, Inc., New York, USA., ISBN-13: 9780471971504, Pages: 220.

Fan, Z.P., Y. Chen, J. Ma and S. Zeng, 2011. Erratum: A hybrid genetic algorithmic approach to the maximally diverse grouping problem. J. Oper. Res. Soc., 62: 1423-1430.
CrossRef  |  Direct Link  |  

Feo, T., O. Goldschmidt and M. Khellaf, 1992. One-half approximation algorithms for the k-partition problem. Oper. Res., 40: S170-S173.
CrossRef  |  Direct Link  |  

Feo, T.A. and M. Khellaf, 1990. A class of bounded approximation algorithms for graph partitioning. Networks, 20: 181-195.
CrossRef  |  Direct Link  |  

Lotfi, V. and R. Cerveny, 1991. A final-exam-scheduling package. J. Oper. Res. Soc., 42: 205-216.
Direct Link  |  

Weitz, R.R. and M.T. Jelassi, 1992. Assigning students to groups: A multi‐criteria decision support system approach. Decis. Sci., 23: 746-757.
CrossRef  |  Direct Link  |  

Weitz, R.R. and S. Lakshminarayanan, 1996. On a heuristic for the final exam scheduling problem. J. Oper. Res. Soc., 47: 599-600.
CrossRef  |  Direct Link  |  

Weitz, R.R. and S. Lakshminarayanan, 1998. An empirical comparison of heuristic methods for creating maximally diverse groups. J. Oper. Res. Soc., 49: 635-646.
CrossRef  |  Direct Link  |