Abstract

Job Shop Problem (JSP) is an optimization problem in computer science and operations research in which jobs are assigned to resources at particular times. Each operation has a specific machine that it needs to be processed on and only one operation in a job can be processed at a given time. This problem is one of the best known combinatorial optimization problems. The aim of this project is to adapt Bat, Bee, Firefly, and Flower pollination algorithms, implement and evaluate the developed algorithms for solving Job Shop Problem.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call