Solving Fuzzy based Job Shop Scheduling Problems using Ga and

@inproceedings{Surekha2010SolvingFB,
  title={Solving Fuzzy based Job Shop Scheduling Problems using Ga and},
  author={Surekha and S. Sumathi},
  year={2010}
}
In this paper, we present a genetic algorithm and ant colony optimization algorithm for solving the Job-shop Scheduling Problem (JSSP). The genetic algorithm comprises of different stages like generating the initial population, selecting the individuals for reproduction and reproducing new individuals. Ant Colony Optimization (ACO) is a metaheuristic inspired by the foraging behavior of ants, which is also used to solve this combinatorial optimization problem. In JSSP ants move from one machine… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 14 references

Deterministic JobShop Scheduling : Past , Present and Future ”

  • Li Xiaoping
  • European Journal of Operational Research
  • 1999

Similar Papers

Loading similar papers…