Solving the Job Shop Scheduling Problem with an Enhanced Artificial Bee Colony Algorithm through Local Search Heuristic

Abstract

Aims: In this paper, we propose an enhanced artificial bee colony (ABC) algorithm for the job shop scheduling problem. Background: Meta-heuristic approaches are widely applied to solve job shop scheduling problem and find the near optimal solutions in polynomial time. Objective: Improving performance of ABC algorithm to solve job shop scheduling problem. Methods: Using local search heuristics in ABC algorithm. Results: The experimental results showed that the proposed algorithm improves the efficiency. Conclusion: Proposed algorithm improves efficiency.