An effective operations permutation-based discrete harmony search approach for the flexible job shop scheduling problem with makespan criterion

The Flexible Job Shop Scheduling Problem (FJSSP) represents a challenging applicative problem for metaheuristic algorithms because it imposes the development of innovative domain-dependent search operators that have to deal both with its combined discrete and permutation nature. Emerging as an effective approach for the resolution of a broad spectrum of hard optimization problems, some few discrete declinations of the Harmony Search (HS) algorithm have been recently proposed for tackling the FJSSP. Recent advances include an investigation of an innovative and promising permutation-based proposal. Accordingly, this paper proposes an Effective Operations Permutation-based Discrete Harmony Search (EOP-DHS) approach for FJSSP with Makespan criterion. The approach adopts an integrated two-part “affectation-sequencing” representation of the solution harmony and a dedicated improvisation operator particularly adapted to the integer-valued and operations permutation-based used coding scheme. Besides, a Modified Intelligent Mutation (MIM) operator is integrated to the adopted framework in order to enhance its overall search ability. Mainly, by balancing maximum machine workload during the overall search process, MIM operator allows essentially maintaining and enhancing the reciprocal equilibrium of diversification and intensification abilities of the proposed EOP-DHS algorithm. Conducted numerical experimentations on 188 benchmarking instances validate the proposal comparatively to a representative set of previously deployed metaheuristic approaches to FJSSP with Makespan criterion. Furthermore, main contribution of the paper is extended with an experimental procedure proving the effectiveness of the adopted permutation-based HS scheme for the resolution of combinatorial optimization problems. Hard benchmarking instances of the classical Job Shop Scheduling Problem (JSSP) are thus considered for exemplification.

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

[2]  Ahmed Chiheb Ammari,et al.  An effective and distributed particle swarm optimization algorithm for flexible job-shop scheduling problem , 2015, Journal of Intelligent Manufacturing.

[3]  Trong-The Nguyen,et al.  Parallel bat algorithm for optimizing makespan in job shop scheduling problems , 2015, Journal of Intelligent Manufacturing.

[4]  Francisco Herrera,et al.  A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms , 2011, Swarm Evol. Comput..

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

[6]  Mitsuo Gen,et al.  Multistage-Based Genetic Algorithm for Flexible Job-Shop Scheduling Problem , 2009 .

[7]  Mandava Rajeswari,et al.  The variants of the harmony search algorithm: an overview , 2011, Artificial Intelligence Review.

[8]  Ahmed Azab,et al.  Mathematical modelling and a meta-heuristic for flexible job shop scheduling , 2013 .

[9]  Banu Çalis,et al.  A research survey: review of AI solution strategies of job shop scheduling problem , 2013, Journal of Intelligent Manufacturing.

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

[11]  Chao Lu,et al.  An effective multi-objective discrete grey wolf optimizer for a real-world scheduling problem in welding production , 2016, Adv. Eng. Softw..

[12]  Mitsuo Gen,et al.  A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems , 2007, Comput. Ind. Eng..

[13]  Mehmet Fatih Tasgetiren,et al.  An effective discrete harmony search algorithm for flexible job shop scheduling problem with fuzzy processing time , 2015 .

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

[15]  Steven Li,et al.  A simplified binary harmony search algorithm for large scale 0-1 knapsack problems , 2015, Expert Syst. Appl..

[16]  Bijaya K. Panigrahi,et al.  Dynamic economic load dispatch using hybrid swarm intelligence based harmony search algorithm , 2011, Expert Syst. Appl..

[17]  Mostafa Zandieh,et al.  An artificial immune algorithm for the flexible job-shop scheduling problem , 2010, Future Gener. Comput. Syst..

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

[19]  Hong Zhou,et al.  Hybridization of harmony search with variable neighborhood search for restrictive single-machine earliness/tardiness problem , 2013, Inf. Sci..

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

[21]  Tsung-Che Chiang,et al.  A simple and effective evolutionary algorithm for multiobjective flexible job shop scheduling , 2013 .

[22]  Leila Asadzadeh,et al.  A local search genetic algorithm for the job shop scheduling problem with intelligent agents , 2015, Comput. Ind. Eng..

[23]  Chao Lu,et al.  A hybrid multi-objective grey wolf optimizer for dynamic scheduling in a real-world welding industry , 2017, Eng. Appl. Artif. Intell..

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

[25]  Brahim Bouzouia,et al.  Meta-heuristics Approaches for the Flexible Job Shop Scheduling Problem , 2016 .

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

[27]  F. Wilcoxon.  Individual Comparisons by Ranking Methods , 1945 .

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

[29]  Ye Xu,et al.  A bi-population based estimation of distribution algorithm for the flexible job-shop scheduling problem , 2012, Comput. Ind. Eng..

[30]  Arit Thammano,et al.  A new algorithm for flexible job-shop scheduling problem based on particle swarm optimization , 2015, Artificial Life and Robotics.

[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]  Mostafa Zandieh,et al.  Flexible job-shop scheduling with parallel variable neighborhood search algorithm , 2010, Expert Syst. Appl..

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

[34]  Mehmet Fatih Tasgetiren,et al.  Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms , 2010, Expert Syst. Appl..

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

[36]  Zong Woo Geem,et al.  A New Heuristic Optimization Algorithm: Harmony Search , 2001, Simul..

[37]  Nasr Al-Hinai,et al.  An efficient hybridized genetic algorithm architecture for the flexible job shop scheduling problem , 2011 .

[38]  Beatrice M. Ombuki-Berman,et al.  Local Search Genetic Algorithms for the Job Shop Scheduling Problem , 2004, Applied Intelligence.

[39]  Quan-Ke Pan,et al.  Discrete harmony search algorithm for the no-wait flow shop scheduling problem with total flow time criterion , 2011 .

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

[41]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[42]  Ziad Kobti,et al.  A memetic algorithm for job shop scheduling using a critical-path-based local search heuristic , 2012, Memetic Comput..

[43]  Shaomin Wu,et al.  An elitist quantum-inspired evolutionary algorithm for the flexible job-shop scheduling problem , 2017, J. Intell. Manuf..

[44]  Fuqing Zhao,et al.  An improved shuffled complex evolution algorithm with sequence mapping mechanism for job shop scheduling problems , 2015, Expert Syst. Appl..

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

[46]  Mehmet Fatih Tasgetiren,et al.  A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem , 2011, Comput. Ind. Eng..

[47]  Jing Chen,et al.  A hybrid dynamic harmony search algorithm for identical parallel machines scheduling , 2012 .

[48]  M. Fesanghary,et al.  An improved harmony search algorithm for solving optimization problems , 2007, Appl. Math. Comput..

[49]  K. Lee,et al.  The harmony search heuristic algorithm for discrete structural optimization , 2005 .

[50]  Zong Woo Geem,et al.  A survey on applications of the harmony search algorithm , 2013, Eng. Appl. Artif. Intell..

[51]  Mohamed Kurdi,et al.  An effective new island model genetic algorithm for job shop scheduling problem , 2016, Comput. Oper. Res..

[52]  Shengyao Wang,et al.  An effective artificial bee colony algorithm for the flexible job-shop scheduling problem , 2012 .

[53]  Jiadong Yang,et al.  A hybrid harmony search algorithm for the flexible job shop scheduling problem , 2013, Appl. Soft Comput..

[54]  Dexuan Zou,et al.  A novel global harmony search algorithm for reliability problems , 2010, Comput. Ind. Eng..

[55]  Xinyu Li,et al.  An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem , 2016 .

[56]  Jing J. Liang,et al.  A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problem , 2011, Expert Syst. Appl..

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

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

[59]  Xiaohua Wang,et al.  A hybrid biogeography-based optimization algorithm for job shop scheduling problem , 2014, Comput. Ind. Eng..

[60]  Mostafa Zandieh,et al.  A new biogeography-based optimization (BBO) algorithm for the flexible job shop scheduling problem , 2012 .