A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem

A novel hybrid tabu search algorithm with a fast public critical block neighborhood structure (TSPCB) is proposed in this paper to solve the flexible job shop scheduling problem with the criterion to minimize the maximum completion time (makespan). First, a mix of four machine assignment rules and four operation scheduling rules is developed to improve the quality of initial solutions to empower the hybrid algorithm with good exploration capability. Second, an effective neighborhood structure to conduct local search in the machine assignment module is proposed, which integrates three adaptive approaches. Third, a speedup local search method with three kinds of insert and swap neighborhood structures based on public critical block theory is presented. With the fast neighborhood structure, the TSPCB algorithm can enhance its exploitation capability. Simulation results based on the well-known benchmarks and statistical performance comparisons are provided. It is concluded that the proposed TSPCB algorithm is superior to several recently published algorithms in terms of solution quality, convergence ability, and efficiency.

[1]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[2]  Fred Glover,et al.  Tabu Search: A Tutorial , 1990 .

[3]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[4]  Mauro Dell'Amico,et al.  Applying tabu search to the job-shop scheduling problem , 1993, Ann. Oper. Res..

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

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

[7]  Jacek Blazewicz,et al.  The job shop scheduling problem: Conventional and new solution techniques , 1996 .

[8]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

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

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

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

[12]  Egon Balas,et al.  Guided Local Search with Shifting Bottleneck for Job Shop Scheduling , 1998 .

[13]  Sheik Meeran,et al.  Deterministic job-shop scheduling: Past, present and future , 1999, Eur. J. Oper. Res..

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

[15]  Pierre Borne,et al.  Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic , 2002, Math. Comput. Simul..

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

[17]  Hyun Joon Shin,et al.  Scheduling jobs on parallel machines: a restricted tabu search approach , 2003 .

[18]  Peter Brucker,et al.  Job-shop scheduling with multi-purpose machines , 1991, Computing.

[19]  Zhiming Wu,et al.  An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems , 2005, Comput. Ind. Eng..

[20]  Deming Lei,et al.  Tabu search for multiple-criteria manufacturing cell design , 2006 .

[21]  Nhu Binh Ho,et al.  An effective architecture for learning and evolving flexible job-shop schedules , 2007, Eur. J. Oper. Res..

[22]  Ajith Abraham,et al.  A novel Variable Neighborhood Particle Swarm Optimization for multi-objective Flexible Job-Shop Scheduling Problems , 2007, 2007 2nd International Conference on Digital Information Management.

[23]  Peigen Li,et al.  A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem , 2007, Comput. Oper. Res..

[24]  Fariborz Jolai,et al.  Mathematical modeling and heuristic approaches to flexible job shop scheduling problems , 2007, J. Intell. Manuf..

[25]  Mohammad Saidi-Mehrabad,et al.  Flexible job shop scheduling with tabu search algorithms , 2007 .

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

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

[28]  Jean-Charles Billaut,et al.  A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem , 2008, Eur. J. Oper. Res..

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

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

[31]  Mostafa Zandieh,et al.  Flexible job-shop scheduling with parallel variable neighborhood search algorithm , 2010, Expert Syst. Appl..