SOLVING FLOW SHOP SCHEDULING PROBLEM USING GENETIC ALGORITHM AND SIMULATED ANNEALING

• Author(s):

  Suganya.R | Dr.B.S.E.Zoraida

• Keywords:

  Genetic Algorithm, Makespan, Selection Schemes, Simulated Annealing.

• Abstract:

  Flow Shop Scheduling Is One Of The Most Interesting NP-hard Problems. As The Flow Shop Scheduling Is An Optimization Problem, In This Work, Genetic Algorithm (GA) Was Selected To Solve For The Benchmark Problem To Minimize The Makespan. Selection Scheme I

---

Other Details

• Paper id:

  IJSARTV3I817340

• Published in:

  Volume: 3 Issue: 8 August 2017

• Publication Date:

  2017-08-31

Download Article