This paper presents a Memetic Chicken swarm optimization (MeCSO) to solve job shop scheduling problem (JSSP). The aim is to find a better solution which minimizes the maximum of the completion time also called Makespan. In this paper, we adapt the chicken swarm algorithm which take into consideration the hierarchical order of chicken swarm while seeking for food. Moreover, we integrate 2-opt method to improve the movement of the rooster. The new algorithm is applied on some instances of OR-Library. The empirical results show the forcefulness of MeCSO comparing to other metaheuristics from literature in term of run time and quality of solution
Abstract- Job shop scheduling problems are NP-hard problems. This paper presents a hybrid algorithm ...
Particle Swarm Optimization (PSO) is a population-based metaheuristic that was modelled based on the...
Ant Colony Optimization (ACO) is a new algorithm approach, inspired by the foraging behavior of real...
This paper presents a Memetic Chicken swarm optimization (MeCSO) to solve job shop scheduling proble...
The job-shop scheduling problem is well known for its complexity as an NP-hard problem. We have cons...
AbstractScheduling is the proper allocation of resources over a period for performing a set of tasks...
The Job Shop Scheduling Problem (JSP) is a combinatorial optimization problem cataloged as type NP-H...
In the vast optimization field, many computer-aided techniques were proposed and tested in the last ...
The job-shop scheduling problem (JSSP) is a branch of production scheduling, and it is well known th...
AbstractJob shop scheduling problem is a well known scheduling problem in which most of them are cat...
The classical job shop scheduling (JSS) problem can be extended by allowing processing of an operati...
The job-shop scheduling problem (JSSP) is known to be NP-hard. Due to its complexity, many metaheuri...
The job shop scheduling problem (JSSP) is one of the most researched scheduling problems. This probl...
Genetic Algorithms (GAs) are a class of evolutionary algorithms that have been successfullyapplied t...
AbstractJob shop scheduling is predominantly an Non deterministic polynomial (NP)- complete challeng...
Abstract- Job shop scheduling problems are NP-hard problems. This paper presents a hybrid algorithm ...
Particle Swarm Optimization (PSO) is a population-based metaheuristic that was modelled based on the...
Ant Colony Optimization (ACO) is a new algorithm approach, inspired by the foraging behavior of real...
This paper presents a Memetic Chicken swarm optimization (MeCSO) to solve job shop scheduling proble...
The job-shop scheduling problem is well known for its complexity as an NP-hard problem. We have cons...
AbstractScheduling is the proper allocation of resources over a period for performing a set of tasks...
The Job Shop Scheduling Problem (JSP) is a combinatorial optimization problem cataloged as type NP-H...
In the vast optimization field, many computer-aided techniques were proposed and tested in the last ...
The job-shop scheduling problem (JSSP) is a branch of production scheduling, and it is well known th...
AbstractJob shop scheduling problem is a well known scheduling problem in which most of them are cat...
The classical job shop scheduling (JSS) problem can be extended by allowing processing of an operati...
The job-shop scheduling problem (JSSP) is known to be NP-hard. Due to its complexity, many metaheuri...
The job shop scheduling problem (JSSP) is one of the most researched scheduling problems. This probl...
Genetic Algorithms (GAs) are a class of evolutionary algorithms that have been successfullyapplied t...
AbstractJob shop scheduling is predominantly an Non deterministic polynomial (NP)- complete challeng...
Abstract- Job shop scheduling problems are NP-hard problems. This paper presents a hybrid algorithm ...
Particle Swarm Optimization (PSO) is a population-based metaheuristic that was modelled based on the...
Ant Colony Optimization (ACO) is a new algorithm approach, inspired by the foraging behavior of real...