Solving the Job Scheduling Problem in Open Shop Using Bat Algorithm
Publish place: Journal of Advances in Computer Research، Vol: 13، Issue: 2
Publish Year: 1401
نوع سند: مقاله ژورنالی
زبان: English
View: 99
This Paper With 7 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_JACR-13-2_002
تاریخ نمایه سازی: 16 مهر 1401
Abstract:
An optimal scheduling reduces the completion time (makespan) of jobs, and finally increase profits in today's competitive environment. Open shop scheduling problem (OSSP) involves a set of activities that should be performed on a limited set of machines. The aim of scheduling in an open shop is to provide a schedule for the execution of the entire operation so that the completion time of all operations is reduced. OSSP has a large solution space and belongs to NP-hard problems. So far, various algorithms are developed for OSSP. In this paper we propose a new optimization algorithm named Bat Algorithm (BA) for solving OSSP which has a relative advantage over other algorithms. Experimental results show that the proposed algorithm has high performance and increases the reliability and efficiency of the system.
Keywords:
Authors
Sima Sivandi
Department of Computer Engineering, University College of Allameh tabarsi, Qaemshahr, Iran