OPTIMIZATION OF JOB SHOP SCHEDULING PROBLEM USING JAYA ALGORITHM

• Author(s):

  Shah H. K. | Raj Abhishek K. | Mehta A. A. | H. S. Keesari

• Keywords:

  Jaya Algorithm, Job Shop Scheduling Problem, Makespan, Position Based Crossover Mechanism.

• Abstract:

  Optimization Algorithms Are Search Methods Where The Goal Is To Find An Optimal Solution To A Problem In Order To Satisfy One Or More Objective Functions Which Are Possibly Subjected To A Set Of Constraints. In This Study, A Recently Developed Jaya Al

---

Other Details

• Paper id:

  IJSARTV2I3883

• Published in:

  Volume: 2 Issue: 3 March 2016

• Publication Date:

  2016-03-13

Download Article