The new golf neighborhood for the exible job shop problem

Abstract job shop problem. A main idea of the proposed neighborhood is to execute a ‘long shot’ of an operation from the current operation’s machine to another machine of the same type, and then to the make a small move by using a local optimization algorithm without changing operationsto-machines assignment. We call this method ‘the golf neighborhood’. Computational experiments executed on the benchmark instances from the literature show the efficiency of this solution.

[1]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

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

[3]  Nhu Binh Ho,et al.  GENACE: an efficient cultural algorithm for solving the flexible job-shop problem , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[4]  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.

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

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

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

[8]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

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

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

[11]  Mieczysław Wodecki,et al.  A Very Fast Tabu Search Algorithm for Job Shop Problem , 2005 .

[12]  Wojciech Bozejko,et al.  On the theoretical properties of swap multimoves , 2007, Oper. Res. Lett..

[13]  E. Nowicki,et al.  A fast tabu search algorithm for the permutation flow-shop problem , 1996 .

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

[15]  Andrzej Adrabiński,et al.  Algorithm 66 - An algorithm for solving the machine sequencing problem with parallel machines , 1979 .

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

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

[18]  Wojciech Bozejko,et al.  Parallel hybrid metaheuristics for the flexible job shop problem , 2010, Comput. Ind. Eng..

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

[20]  Wojciech Bozejko,et al.  Solving permutational routing problems by population-based metaheuristics , 2009, Comput. Ind. Eng..

[21]  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..