Routing and scheduling in a flexible job shop by tabu search
Annals of Operations Research - Special issue on Tabu search
A new approach to solve hybrid flow shop scheduling problems by artificial immune system
Future Generation Computer Systems - Special issue: Computational science of lattice Boltzmann modelling
Computers and Operations Research
A genetic algorithm for the Flexible Job-shop Scheduling Problem
Computers and Operations Research
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
A variable neighborhood search for job shop scheduling with set-up times to minimize makespan
Future Generation Computer Systems
An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems
Computers and Industrial Engineering
Immune algorithms-based approach for redundant reliability problems with multiple component choices
Computers in Industry - Special issue: Application of genetics algorithms in industry
Applying the clonal selection principle to find flexible job-shop schedules
ICARIS'05 Proceedings of the 4th international conference on Artificial Immune Systems
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Guest editorial special issue on artificial immune systems
IEEE Transactions on Evolutionary Computation
Modular design of a hybrid genetic algorithm for a flexible job-shop scheduling problem
Knowledge-Based Systems
Flexible job shop scheduling using a multiobjective memetic algorithm
ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing Theories and Applications: with aspects of artificial intelligence
An artificial immune system for solving production scheduling problems: a review
Artificial Intelligence Review
Flexible job shop scheduling using hybrid differential evolution algorithms
Computers and Industrial Engineering
A hybrid harmony search algorithm for the flexible job shop scheduling problem
Applied Soft Computing
An integrated search heuristic for large-scale flexible job shop scheduling problems
Computers and Operations Research
Path-relinking Tabu search for the multi-objective flexible job shop scheduling problem
Computers and Operations Research
Hi-index | 0.00 |
This article addresses the flexible job-shop scheduling problem (FJSP) to minimize makespan. The FJSP is strongly NP-hard and consists of two sub-problems. The first one is to assign each operation to a machine out of a set of capable machines, and the second one deals with sequencing the assigned operations on all machines. To solve this problem, an artificial immune algorithm (AIA) based on integrated approach is proposed. This algorithm uses several strategies for generating the initial population and selecting the individuals for reproduction. Different mutation operators are also utilized for reproducing new individuals. To show the effectiveness of the proposed method, numerical experiments by using benchmark problems are conducted. Consequently, the computational results validate the quality of the proposed approach.