References
- AartsELenstraJKLocal Search in Combinatorial Optimization2003
- AraniTLotfiVA three phased approach to final exam schedulingIIE T198921869610.1080/07408178908966211
- AzimiZNHybrid heuristics for examination timetabling problemAppl Math C200516370573310.1016/j.amc.2003.10.061
- BakerBMBennCAssigning pupils to tutor groups in a comprehensive schoolJ Opl Res Soc20015262362910.1057/palgrave.jors.2601135
- BakerKRPowellSGMethods for assigning students to groups: A study of alternative objective functionsJ Opl Res Soc20025339740410.1057/palgrave.jors.2601307
- BhaduryJMightyEJDamarHMaximizing workforce diversity in project teams: A network flow approachOmega20002814315310.1016/S0305-0483(99)00037-7
- Bock F (1958). An algorithm for solving ‘traveling salesman' and related network optimization problems. Talk given at the 14th ORSA Meeting, St. Louis, 23 October, 1958.
- CroesGAA method for solving traveling salesman problemsOperns Res1958679181210.1287/opre.6.6.791
- Davis L (1985). Job shop scheduling with genetic algorithms. In: Grenfenstette JJ (ed). Proceedings of the First International Conference on Genetic Algorithms. L. Erlbaum Associates: Hillsdale, NJ, pp 136–140.
- DavisLSteenstrupMGenetic algorithms and simulated annealing: An overviewGenetic Algorithm and Simulated Annealing1987111
- EtilerOTokluBAtakMWilsonJA genetic algorithm for flow shop scheduling problemsJ Opl Res Soc20045583083510.1057/palgrave.jors.2601766
- FalkenauerEGenetic Algorithms for Grouping Problems1998
- FeoTKhellafMA class of bounded approximation algorithms for graph partitioningNetworks19902018119510.1002/net.3230200205
- FeoTGoldschmidtOKhellafMOne-half approximation algorithms for the k-partition problemOpns Res19924017017310.1287/opre.40.1.S170
- GenMChengRGenetic Algorithms and Engineering Design1997
- GoldbergDEGenetic Algorithms in Search, Optimization and Machine Learning1989
- Gorges-Schleuter M (1989). ASPARAGOS: An asynchronous parallel genetic optimization strategy. In: Schaffer J (ed). Proceedings of the Third International Conference on Genetic Algorithms. Morgan Kaufmann Publishers: San Mateo, CA, pp 422–427.
- Hettich S and Pazzani MJ (2006). Mining for element reviewers: Lessons learned at the national science foundation. In: Proceedings of the KDD'06. ACM: New York, NY, pp 862–871.
- HollandJHAdaptation in Natural and Artificial Systems1975
- LotfiVCervenyRA final-exam-scheduling packageJ Opl Res Soc19914220521610.1057/jors.1991.42
- MillerJPotterWGandhamRLapenaCAn evaluation of local improvement operators for genetic algorithmsIEEE T Syst Man Cybern1993231340135110.1109/21.260665
- MühlenbeinHHow genetic algorithms really work: Part I. Mutation and hill-climbingParallel Problem Solving from Nature: PPSN II19921526
- ShiGA genetic algorithm applied to a classic job-shop scheduling problemInt J Sys Sci199728253210.1080/00207729708929359
- VaessensRJMAartsEHLenstraJKA local search templateComput Opns19982596997910.1016/S0305-0548(97)00093-2
- VaskoFJKnollePJSpiegelDSAn empirical study of hybrid genetic algorithms for the set covering problemJ Opl Res Soc2005561213122310.1057/palgrave.jors.2601919
- WangHFWuKYModeling and analysis for multi-period, multi-product and multi-resource production schedulingJ Intell M20031429730910.1023/A:1024645608673
- WangHFWuKYHybrid genetic algorithm for optimization problems with permutation propertyComput Opns2004312453247110.1016/S0305-0548(03)00198-9
- WeitzRRJelassiMTAssigning students to groups: a multi-criteria decision support system approachDec Sci19922374675710.1111/j.1540-5915.1992.tb00415.x
- WeitzRRLakshminarayananSOn a heuristic for the final exam scheduling problemJ Opl Res Soc19964759960010.1057/jors.1996.72
- WeitzRRLakshminarayananSAn empirical comparison of heuristic methods for creating maximally diverse groupsJ Opl Res Soc19984963564610.1057/palgrave.jors.2600510
- WhitleyDStarkwetherTShanerDThe traveling salesman and sequence scheduling problems: Quality solutions using genetic edge recombinationHandbook of Genetic Algorithms1991350372
- Yannakakis M (1990). The analysis of local search problems and their heuristics. In: Choffrut C and Lengauer T (eds). Proceedings 7th Annual Symposium on Theoretical Aspects of Computer Science (STACS 90), Lecture Notes in Computer Science, Vol. 415. Springer-Verlag: London, pp 298–311.