Genetic algorithm scheduling: Difference between revisions

Revision as of 22:51, 28 October 2007

Revision as of 22:59, 28 October 2007

Line 1:

{{dated prod|concern = {{{concern|original research and copyvio''' (note the refs to two figures at the end)}}}|month = October|day = 28|year = 2007|time = 17:58|timestamp = 20071028175824}}

<!-- Do not use the "dated prod" template directly; the above line is generated by "subst:prod|reason" -->

To be competitive, corporations must minimize inefficiencies and maximize productivity. In manufacturing, productivity is inherently linked to how well you can optimize the resources you have, reduce waste and increase efficiency. Finding the best way to maximize efficiency in a manufacturing process can be extremely complex. Even on a simple projects, there are multiple inputs, multiple steps, many constraints and limited resources. In general a resource constrained scheduling problem consists of:

*A set of jobs that must be executed