Routing and scheduling in a flexible job shop by tabu search
Annals of Operations Research - Special issue on Tabu search
Computers and Operations Research
Toward Self-Integrating Software Applications for Supply Chain Management
Information Systems Frontiers
Cooperative Parallel Variable Neighborhood Search for the p-Median
Journal of Heuristics
Computers and Industrial Engineering - Special issue: Selected papers from the 30th international conference on computers; industrial engineering
An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems
Computers and Industrial Engineering
Computers and Operations Research
A genetic algorithm for the Flexible Job-shop Scheduling Problem
Computers and Operations Research
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Parallel hybrid metaheuristics for the flexible job shop problem
Computers and Industrial Engineering
An effective genetic algorithm for the flexible job-shop scheduling problem
Expert Systems with Applications: An International Journal
An adaptive annealing genetic algorithm for the job-shop planning and scheduling problem
Expert Systems with Applications: An International Journal
Computers and Industrial Engineering
Tabu search and lower bound for an industrial complex shop scheduling problem
Computers and Industrial Engineering
Expert Systems with Applications: An International Journal
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
Information Sciences: an International Journal
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
Minimizing the total completion time in a distributed two stage assembly system with setup times
Computers and Operations Research
Path-relinking Tabu search for the multi-objective flexible job shop scheduling problem
Computers and Operations Research
Hi-index | 12.06 |
Flexible job-shop scheduling problem (FJSP) is an extension of the classical job-shop scheduling problem. FJSP is NP-hard and mainly presents two difficulties. 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 the machines. This paper proposes a parallel variable neighborhood search (PVNS) algorithm that solves the FJSP to minimize makespan time. Parallelization in this algorithm is based on the application of multiple independent searches increasing the exploration in the search space. The proposed PVNS uses various neighborhood structures which carry the responsibility of making changes in assignment and sequencing of operations for generating neighboring solutions. The results obtained from the computational study have shown that the proposed algorithm is a viable and effective approach for the FJSP.