2005 · 138 citations · 14 references
ManagementOperations ManagementProduction PlanningRecombinationSchedulingCombinatorial OptimizationEvolutionary ComputationEvolutionary OptimizationGenetic AlgorithmsJob Shop SchedulingPopulation-based SearchCultural AlgorithmsEvolutionary SearchFlexible Job Shop SchedulingHeuristic AlgorithmsMetaheuristic SchedulingRepresentation In Evolutionary AlgorithmsScheduling HeuristicsUpper Bounds
This work presents an efficient methodology called GENACE for solving the flexible job-shop scheduling problem (or FJSP) with recirculation. We show how CDRs are used to solve the FJSP with recirculation by themselves and to provide a bootstrapping mechanism to initialize GENACE. We then adopt a cultural evolutionary architecture to maintain knowledge of schemata and resource allocations learned over each generation. The belief spaces influence mutation and selection over a feasible chromosome representation. Experimental results show that GENACE obtains better upper bounds for 11 out of 13 benchmark problems, with improvement factors of 2 to 48 percent when compared to results by Kacem et al. (2002), Brandimarte (1993) and of using CDRs alone.
14
Genetic algorithms in search, optimization, and machine learning
Choice Reviews Online · 1989 · 49.3K citations
The Complexity of Flowshop and Jobshop Scheduling
M. R. Garey, David Johnson, Ravi Sethi · Mathematics of Operations Research · 1976 · 2.6K citations
Jon Doyle · Artificial Intelligence · 1979 · 1.8K citations · Full text
S. S. Panwalkar, Wafik H. Iskander · Operations Research · 1977 · 1.3K citations