A Hybrid Iterated Local Search Metaheuristic for the Flexible job Shop Scheduling Problem

In the flexible job shop scheduling problem (FJSP) we have a set of jobs and a set of machines. A job is characterized by a set of operations that must be processed in a predetermined order. Each operation can be processed in a specific set of machines and each of these machines can process at most one operation at a time, respecting the restriction that before starting a new operation, the current one must be finished. Scheduling is an assignment of operations at time intervals on machines. The classic objective of the FJSP is to find a schedule that minimizes the completion time of the jobs, called makespan. Considering that the FJSP is an NP-hard problem, solution methods based on metaheuristics become a good alternative, since they aim to explore the space of solutions in an intelligent way, obtaining high-quality but not necessarily optimal solutions at a reduced computational cost. Thus, to solve the FJSP, this article describes a hybrid iterated local search (HILS) algorithm, which uses the simulated annealing (SA) metaheuristic as local search. Computational experiments with a standard set of instances of the problem indicated that the proposed HILS implementation is robust and competitive when compared with the best algorithms of the literature.

[1]  Glaydston Mattos Ribeiro,et al.  A simple and robust Simulated Annealing algorithm for scheduling workover rigs on onshore oil fields , 2011, Comput. Ind. Eng..

[2]  Quan-Ke Pan,et al.  Discrete harmony search algorithm for flexible job shop scheduling problem with multiple objectives , 2016, J. Intell. Manuf..

[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]  Cristina G. Fernandes,et al.  A MILP model for an extended version of the Flexible Job Shop Problem , 2014, Optim. Lett..

[5]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

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

[7]  Pierre Hansen,et al.  First vs. best improvement: An empirical study , 1999, Discret. Appl. Math..

[8]  Camino R. Vela,et al.  Scatter search with path relinking for the flexible job shop scheduling problem , 2015, Eur. J. Oper. Res..

[9]  Didem Cinar,et al.  A Taxonomy for the Flexible Job Shop Scheduling Problem , 2015 .

[10]  Peter Brucker,et al.  Complex Scheduling (GOR-Publications) , 2006 .

[11]  Siba Sankar Mahapatra,et al.  A quantum behaved particle swarm optimization for flexible job shop scheduling , 2016, Comput. Ind. Eng..

[12]  Ryosuke Kubota,et al.  Effective hierarchical optimization by a hierarchical multi-space competitive genetic algorithm for the flexible job-shop scheduling problem , 2015, Expert Syst. Appl..

[13]  M. Fatih Tasgetiren,et al.  A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities , 2014 .

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

[15]  Nouara Achour,et al.  An effective operations permutation-based discrete harmony search approach for the flexible job shop scheduling problem with makespan criterion , 2017, Applied Intelligence.

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

[17]  Wellington Donizeti Previero,et al.  Estratégias de resolução para o problema de job-shop flexível , 2016 .

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

[19]  Kejia Zhuang,et al.  Hybrid artificial bee colony algorithm with a rescheduling strategy for solving flexible job shop scheduling problems , 2017, Comput. Ind. Eng..

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

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

[22]  Liang Gao,et al.  An effective genetic algorithm for the flexible job-shop scheduling problem , 2011, Expert Syst. Appl..

[23]  Abid Ali Khan,et al.  A research survey: review of flexible job shop scheduling techniques , 2016, Int. Trans. Oper. Res..

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

[25]  William J. Cook,et al.  A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.

[26]  Rafael Martí,et al.  GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization , 1999, INFORMS J. Comput..