Multi-GPU Tabu Search Metaheuristic for the Flexible Job Shop Scheduling Problem

We propose a new framework of the distributed tabu search metaheuristic designed to be executed using a multi-GPU cluster, i.e. cluster of nodes equipped with GPU computing units. The methodology is designed to solve difficult discrete optimization problems, such as a job shop scheduling problem, which we introduce to solve as a case study for the framework designed.

[1]  Andrew Y. C. Nee,et al.  A modified genetic algorithm for distributed scheduling problems , 2003, J. Intell. Manuf..

[2]  Michael J. Flynn,et al.  Very high-speed computing systems , 1966 .

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

[4]  Sheik Meeran,et al.  New and “Stronger” Job-Shop Neighbourhoods: A Focus on the Method of Nowicki and Smutnicki (1996) , 2000, J. Heuristics.

[5]  Mitsuo Gen,et al.  A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems , 2008, Comput. Oper. Res..

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

[7]  Chandrasekharan Rajendran,et al.  Efficient jobshop dispatching rules: Further developments , 2000 .

[8]  Eugeniusz Nowicki,et al.  An Advanced Tabu Search Algorithm for the Job Shop Problem , 2005, J. Sched..

[9]  Wojciech Bożejko,et al.  A New Class of Parallel Scheduling Algorithms , 2010 .

[10]  Pierre Borne,et al.  Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems , 2002, IEEE Trans. Syst. Man Cybern. Part C.

[11]  Emanuela Merelli,et al.  A tabu search method guided by shifting bottleneck for the job shop scheduling problem , 2000, Eur. J. Oper. Res..

[12]  Vinicius Amaral Armentano,et al.  Tabu search for minimizing total tardiness in a job shop , 2000 .

[13]  Jacek M. Zurada,et al.  Artificial Intelligence and Soft Computing, 10th International Conference, ICAISC 2010, Zakopane, Poland, June 13-17, 2010, Part I , 2010, International Conference on Artificial Intelligence and Soft Computing.

[14]  Wojciech Bozejko,et al.  Parallel Meta2heuristics for the Flexible Job Shop Problem , 2010, ICAISC.

[15]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[16]  Christian Bierwirth,et al.  An efficient genetic algorithm for job shop scheduling with tardiness objectives , 2004, Eur. J. Oper. Res..

[17]  Jan Paulli,et al.  A hierarchical approach for the FMS scheduling problem , 1995 .

[18]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[19]  Wojciech Boejko.  On single-walk parallelization of the job shop problem solving algorithms , 2012 .

[20]  Johann L. Hurink,et al.  Tabu search for the job-shop scheduling problem with multi-purpose machines , 1994 .

[21]  Fred P. Brooks,et al.  The Mythical Man-Month , 1975, Reliable Software.

[22]  Enrique Alba,et al.  Parallel Metaheuristics: A New Class of Algorithms , 2005 .

[23]  Paolo Brandimarte,et al.  Routing and scheduling in a flexible job shop by tabu search , 1993, Ann. Oper. Res..

[24]  Griffin Caprio,et al.  Parallel Metaheuristics , 2008, IEEE Distributed Systems Online.

[25]  Stefan Voß,et al.  Tabu Search: Applications and Prospects , 1993 .

[26]  Michel Gendreau,et al.  Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements , 1996, Ann. Oper. Res..

[27]  Joseph A. Svestka,et al.  A bi-directional scheduling approach for job shops , 1999 .

[28]  L. A. Pilipchuk,et al.  Network optimization problems , 2002 .

[29]  Wojciech Bozejko,et al.  A Neuro-tabu Search Algorithm for the Job Shop Problem , 2010, ICAISC.

[30]  Saïd Hanafi,et al.  On the Convergence of Tabu Search , 2001, J. Heuristics.

[31]  Stéphane Dauzère-Pérès,et al.  An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search , 1997, Ann. Oper. Res..

[32]  Kuei-Bin Wu,et al.  An efficient configuration generation mechanism to solve job shop scheduling problems by the simulated annealing algorithm , 1999, Int. J. Syst. Sci..