Parallel Artificial Bee Colony Algorithm for Solving Advance Industrial Productivity Problems

Abstract

Scheduling problems play a pivotal role in many of the fields today, such as manufacturing systems, industrial processes, production, etc. The job-shop scheduling problems are categorized as a non-deterministic NP hard problem. It is very complicated to find a better algorithm which can give an optimal solution under a given time constraint. A scheduling can be generally categorized as a set of jobs where each job can have greater than one operation to perform. The main aim of the scheduling would be to resolve the scheduling of the jobs that would minimize a measure of performance. A common measure of performance for dealing with the problems of the scheduling is the makespan of a schedule. Technique for calculating the shop scheduling problem ranges from simple FIFO and SPT to more sophisticated procedures, for instance branch and bound, tabu search, ant colony, genetic algorithm, and many others. The modified version of ABC is parallel ABC (PABC) for solving the JSSP. Projected method basically uses the concept of parallelism for the concept of scheduling.