Genetic algorithm scheduling: Difference between revisions

Revision as of 17:40, 25 July 2020

Latest revision as of 17:56, 5 June 2023

(2 intermediate revisions by 2 users not shown)

Line 7:

* A [[finite set]] of resources that can be used to complete each job

* A set of constraints that must be satisfied

** Temporal Constraints–theconstraints – the time window to complete the task

** Procedural Constraints–theconstraints – the order each task must be completed

** Resource Constraintsconstraints – is the resource available

* A set of objectives to evaluate the scheduling performance

A typical factory floor setting is a good example of this, where it is necessary to schedule which jobs need to be completed on which machines, by which employees, in what order and at what time.

==Use of algorithms in scheduling==

Line 40:

| last1 = Lim | first1 = C.

| last2 = Sim | first2 = E.

| title = Production Planning in Manufacturing/Remanufacturing Environment using Genetic Algorithm }}

| url = https://www.koreascience.or.kr/article/CFKO200536035727674.pdf}}

Line 50 ⟶ 51:

[[Category:Genetic algorithms]]

[[Category:Mathematical optimization in business]]

[[Category:Automated planning and scheduling]]