Talk:Genetic algorithm scheduling

	Mathematics portal This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
???	This article has not yet received a rating on Wikipedia's content assessment scale.
???	This article has not yet received a rating on the project's priority scale.

This page should not be deleted. I had not yet added the figures that I referred to in the article.

Is this page important?

I understand why genetic algorithms should have a page and why scheduling problems should have a page. But their intersection does not seem to deserve its own page. Can this be merged or deleted? AustinBuchanan (talk) 05:30, 4 July 2013 (UTC)[reply]

[I am not AustinBuchanan. I do not even know who s/he is.] I agree with AustinBuchanan. This wiki page references so few papers that it appears to be a page touting those papers, rather than discussing a greater body of knowledge. Also, the statement, "Genetic algorithms are well suited to solving production scheduling problems, because unlike heuristic methods genetic algorithms operate on a population of solutions rather than a single solution" is an opinion for which the writer provides no support. In contrast, while dated, Aarts and Lenstra's seminal book on heuristic methods for combinatorial optimization argues that genetic algorithms are not a natural fit for resource-scheduling problems because of the difficulty of defining an effective crossover method. — Preceding unsigned comment added by 68.100.124.49 (talk) 14:30, 14 March 2016 (UTC)[reply]