1. Ahuja, R. K., & Orlin, J. B. (1997). Developing fitter genetic algorithms. INFORMS Journal on Computing, 9(3), 251–253.
2. Baker, K. R. (1974). Introduction to sequence and scheduling. New York: Wiley.
3. Bentley, J. L. (1990). Experiments on traveling salesman heuristics. In Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms (SODA ’90), pp. 91–99.
4. Chang, P. C., Hsieh, J. C., & Liu, C. H. (2006). A case-injected genetic algorithm for single machine scheduling problems with release time. International Journal of Production Economics, 103(2), 551–564.
5. Eshelman, L., & Schaffer, J. J. D. (1993). Crossover’s niche. In Proceedings of 5th international conference on genetic algorithms (ICGA), pp. 9–14.