Combining Tabu Search and Genetic Algorithm in a Multi-agent System for Solving Flexible Job Shop Problem

The Flexible Job Shop problem (FJSP) is an important extension of the classical job shop scheduling problem, in that each operation can be processed by a set of resources and has a processing time depending on the resource used. The objective is to minimize the make span, i.e., the time needed to complete all the jobs. This works aims to propose a new promising approach using multi-agent systems in order to solve the FJSP. Our model combines a local optimization approach based on Tabu Search (TS) meta-heuristic and a global optimization approach based on genetic algorithm (GA).

[1]  Luca Maria Gambardella,et al.  Effective Neighborhood Functions for the Flexible Job Shop Problem , 1998 .

[2]  Jacques Ferber,et al.  Multi-agent systems - an introduction to distributed artificial intelligence , 1999 .

[3]  F. Pezzella,et al.  A genetic algorithm for the Flexible Job-shop Scheduling Problem , 2008, Comput. Oper. Res..

[4]  Khaled Ghedira,et al.  Flexible job-shop scheduling with multi-agent system and tabu search , 2004 .

[5]  Seyed Ahmad Sheibatolhamdy,et al.  Scheduling in flexible job-shop manufacturing system by improved tabu search , 2011 .

[6]  P. Suganthan,et al.  A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem , 2011 .

[7]  Yang Shi,et al.  A Genetic Algorithm and Tabu Search for Solving Flexible Job Shop Schedules , 2008, 2008 International Symposium on Computational Intelligence and Design.

[8]  Ferdinando Pezzella,et al.  An Improved Genetic Algorithm for the Distributed and Flexible Job-shop Scheduling problem , 2010, Eur. J. Oper. Res..

[9]  Peng Wang,et al.  A Knowledge-Based Ant Colony Optimization for Flexible Job Shop Scheduling Problems , 2010, Appl. Soft Comput..

[10]  Liang Gao,et al.  An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem , 2009, Comput. Ind. Eng..

[11]  Khaled Ghédira,et al.  New local diversification techniques for flexible job shop scheduling problem with a multi-agent approach , 2008, Autonomous Agents and Multi-Agent Systems.

[12]  Robert W. Brennan,et al.  Holonic job shop scheduling using a multiagent system , 2005, IEEE Intelligent Systems.

[13]  Luc Bongaerts,et al.  Reference architecture for holonic manufacturing systems: PROSA , 1998 .

[14]  Ehl Emile Aarts,et al.  A computational study of constraint satisfaction for multiple capacitated job shop scheduling , 1996 .

[15]  Maghsud Solimanpur,et al.  A simulated annealing algorithm for the job shop cell scheduling problem with intercellular moves and reentrant parts , 2011, Comput. Ind. Eng..