Article Per Year (5 Year)
p-Index From 2021 - 2026
0
P-Index
This Author published in this journals
All Journal Bulletin of Electrical Engineering and Informatics Bulletin of Electrical Engineering and Informatics Bulletin of Electrical Engineering and Informatics
Mohamad SanieeAbadeh
Tarbiat Modares University
Computer Science & IT Electrical & Electronics Engineering Engineering

Published : 3 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 3 Documents
Search

 1 
An Effective Multi-Population Based Hybrid Genetic Algorithm for Job Shop Scheduling Problem Somayeh Kalantari; Mohamad SanieeAbadeh
Bulletin of Electrical Engineering and Informatics Vol 2, No 1: March 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (59.198 KB) | DOI: 10.11591/eei.v2i1.262

Abstract

The job shop scheduling problem is a well known practical planning problem in the manufacturing sector. We have considered the JSSP with an objective of minimizing makespan. In this paper, a multi-population based hybrid genetic algorithm is developed for solving the JSSP. The population is divided in several groups at first and the hybrid algorithm is applied to the disjoint groups. Then the migration operator is used. The proposed approach, MP-HGA, have been compared with other algorithms for job-shop scheduling and evaluated with satisfactory results on a set of JSSPs derived from classical job-shop scheduling benchmarks. We have solved 15 benchmark problems and compared results obtained with a number of algorithms established in the literature. The experimental results show that MP-HGA could gain the best known makespan in 13 out of 15 problems.
An Effective Multi-Population Based Hybrid Genetic Algorithm for Job Shop Scheduling Problem Somayeh Kalantari; Mohamad SanieeAbadeh
Bulletin of Electrical Engineering and Informatics Vol 2, No 1: March 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/eei.v2i1.262

Abstract

The job shop scheduling problem is a well known practical planning problem in the manufacturing sector. We have considered the JSSP with an objective of minimizing makespan. In this paper, a multi-population based hybrid genetic algorithm is developed for solving the JSSP. The population is divided in several groups at first and the hybrid algorithm is applied to the disjoint groups. Then the migration operator is used. The proposed approach, MP-HGA, have been compared with other algorithms for job-shop scheduling and evaluated with satisfactory results on a set of JSSPs derived from classical job-shop scheduling benchmarks. We have solved 15 benchmark problems and compared results obtained with a number of algorithms established in the literature. The experimental results show that MP-HGA could gain the best known makespan in 13 out of 15 problems.
An Effective Multi-Population Based Hybrid Genetic Algorithm for Job Shop Scheduling Problem Somayeh Kalantari; Mohamad SanieeAbadeh
Bulletin of Electrical Engineering and Informatics Vol 2, No 1: March 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (59.198 KB) | DOI: 10.11591/eei.v2i1.262

Abstract

The job shop scheduling problem is a well known practical planning problem in the manufacturing sector. We have considered the JSSP with an objective of minimizing makespan. In this paper, a multi-population based hybrid genetic algorithm is developed for solving the JSSP. The population is divided in several groups at first and the hybrid algorithm is applied to the disjoint groups. Then the migration operator is used. The proposed approach, MP-HGA, have been compared with other algorithms for job-shop scheduling and evaluated with satisfactory results on a set of JSSPs derived from classical job-shop scheduling benchmarks. We have solved 15 benchmark problems and compared results obtained with a number of algorithms established in the literature. The experimental results show that MP-HGA could gain the best known makespan in 13 out of 15 problems.
Co-Authors Somayeh Kalantari