A Genetic Algorithm for Some Discrete-Continuous Scheduling Problems
In this paper a Genetic Algorithm (GA) for solving some discrete-continuous scheduling problems is proposed. In this algorithm, each genotype represents a solution which is derived directly from the idea of a feasible sequence rather than being coded as a binary string. Applying suitable genetic operators allows to conduct the searching process in a feasible region only.
KeywordsGenetic Algorithm Mutation Operator Parallel Machine Crossover Operator Genetic Operator
Unable to display preview. Download preview PDF.