Generic placeholder image

Recent Advances in Computer Science and Communications

Editor-in-Chief

ISSN (Print): 2666-2558
ISSN (Online): 2666-2566

Research Article

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

Author(s): Leila Asadzadeh*

Volume 14, Issue 7, 2021

Published on: 15 January, 2020

Page: [2163 - 2170] Pages: 8

DOI: 10.2174/2666255813666200116100449

Price: $65

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.

Keywords: Job shop scheduling problem, artificial bee colony algorithm, local search heuristic, neighborhood search mechanism, scheduling, machine.

Graphical Abstract


Rights & Permissions Print Cite
© 2025 Bentham Science Publishers | Privacy Policy