A Hybrid Crow Search Algorithm for Solving Permutation Flow Shop Scheduling Problems

[1]  Andrew Lewis,et al.  The Whale Optimization Algorithm , 2016, Adv. Eng. Softw..

[2]  Almoataz Y. Abdelaziz,et al.  A novel approach based on crow search algorithm for optimal selection of conductor size in radial distribution networks , 2017 .

[3]  Nirwan Ansari,et al.  Application Aware Workload Allocation for Edge Computing-Based IoT , 2018, IEEE Internet of Things Journal.

[4]  Yan Jin,et al.  A new improved NEH heuristic for permutation flowshop scheduling problems , 2017 .

[5]  I. Osman,et al.  Simulated annealing for permutation flow-shop scheduling , 1989 .

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

[7]  Chinyao Low,et al.  A robust simulated annealing heuristic for flow shop scheduling problems , 2004 .

[8]  Jimmy Ming-Tai Wu,et al.  A Sanitization Approach to Secure Shared Data in an IoT Environment , 2019, IEEE Access.

[9]  Bo Liu,et al.  An Effective PSO-Based Memetic Algorithm for Flow Shop Scheduling , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[10]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[11]  Feng Wang,et al.  Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time , 2015, Eur. J. Oper. Res..

[12]  Raymond Chiong,et al.  An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem , 2015, Appl. Soft Comput..

[13]  Chu-Sing Yang,et al.  A time-efficient pattern reduction algorithm for k-means clustering , 2011, Inf. Sci..

[14]  Chinyao Low,et al.  Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines , 2005, Comput. Oper. Res..

[15]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[16]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[17]  Chu-Sing Yang,et al.  A memetic particle swarm optimization algorithm for solving the DNA fragment assembly problem , 2014, Neural Computing and Applications.

[18]  Jerzy Kamburowski,et al.  An improved NEH heuristic to minimize makespan in permutation flow shops , 2008, Comput. Oper. Res..

[19]  Mohamed El Yafrani,et al.  A hybrid crow search algorithm for solving the DNA fragment assembly problem , 2018, Expert Syst. Appl..

[20]  Philip S. Yu,et al.  HUOPM: High-Utility Occupancy Pattern Mining , 2018, IEEE Transactions on Cybernetics.

[21]  Luis Fernando de Mingo López,et al.  Multidimensional knapsack problem optimization using a binary particle swarm model with genetic operations , 2018, Soft Comput..

[22]  Adriana Giret,et al.  Energy-efficient scheduling for a flexible flow shop using an improved genetic-simulated annealing algorithm , 2013 .

[23]  Mariappan Kadarkarainadar Marichelvam,et al.  Hybrid monkey search algorithm for flow shop scheduling problem under makespan and total flow time , 2017, Appl. Soft Comput..

[24]  Mohamed Abdel-Basset,et al.  A hybrid whale optimization algorithm based on local search strategy for the permutation flow shop scheduling problem , 2018, Future Gener. Comput. Syst..

[25]  Mehmet Fatih Tasgetiren,et al.  A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem , 2007, Eur. J. Oper. Res..

[26]  Philippe Fournier-Viger,et al.  Hiding sensitive itemsets with multiple objective optimization , 2019, Soft Computing.

[27]  Luis Fernando de Mingo López,et al.  Optimal Performance: Underlying Octahedron Graph of Evolutionary Processors , 2015, Comput. Informatics.

[28]  Fayez F. Boctor,et al.  An efficient genetic algorithm to solve the resource-constrained project scheduling problem with transfer times: The single mode case , 2018, Eur. J. Oper. Res..

[29]  Jun Zhang,et al.  A Novel Set-Based Particle Swarm Optimization Method for Discrete Optimization Problems , 2010, IEEE Transactions on Evolutionary Computation.

[30]  É. Taillard.  Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

[31]  Ping Chen,et al.  An improved NEH-based heuristic for the permutation flowshop problem , 2008, Comput. Oper. Res..

[32]  Hossein Nezamabadi-pour,et al.  GSA: A Gravitational Search Algorithm , 2009, Inf. Sci..

[33]  Vijander Singh,et al.  An improved Crow Search Algorithm for high-dimensional problems , 2017, J. Intell. Fuzzy Syst..

[34]  O. Güntürkün,et al.  Mirror-Induced Behavior in the Magpie (Pica pica): Evidence of Self-Recognition , 2008, PLoS biology.

[35]  P. N. Suganthan,et al.  Differential Evolution: A Survey of the State-of-the-Art , 2011, IEEE Transactions on Evolutionary Computation.

[36]  Alireza Askarzadeh,et al.  A novel metaheuristic method for solving constrained engineering optimization problems: Crow search algorithm , 2016 .

[37]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[38]  M Rajkumar,et al.  Minimizing makespan and total flow time in permutation flow shop scheduling problems using modified gravitational emulation local search algorithm , 2018 .

[39]  Jerzy Kamburowski,et al.  An empirical analysis of the optimality rate of flow shop heuristics , 2009, Eur. J. Oper. Res..

[40]  Shih-Wei Lin,et al.  A high-performing constructive heuristic for minimizing makespan in permutation flowshops , 2013 .

[41]  Zhen Ji,et al.  DNA Sequence Compression Using Adaptive Particle Swarm Optimization-Based Memetic Algorithm , 2011, IEEE Transactions on Evolutionary Computation.

[42]  Lu Yang,et al.  Mining of skyline patterns by considering both frequent and utility constraints , 2019, Eng. Appl. Artif. Intell..

[43]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..