Answers are grounded in this paper and cite their sources.
Most scheduling problems are highly complex combinatorial problems. However, stochastic methods such as genetic algorithm yield good solutions. In this paper, we present a controlled genetic algorithm (CGA) based on fuzzy logic and belief functions to solve job-shop scheduling problems. For better performance, we propose an efficient representational scheme, heuristic rules for creating the initial population, and a new methodology for mixing and computing genetic operator probabilities.
No takes yet. Share an insight, caveat, or question.
Hajri et al. (2000) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: