An Effective PSO-Based Hybrid Algorithm for Multiobjective Permutation Flow Shop Scheduling

This paper proposes a hybrid algorithm based on particle swarm optimization (PSO) for a multiobjective permutation flow shop scheduling problem, which is a typical NP-hard combinatorial optimization problem with strong engineering backgrounds. Not only does the proposed multiobjective algorithm (named MOPSO) apply the parallel evolution mechanism of PSO characterized by individual improvement, population cooperation, and competition to effectively perform exploration but it also utilizes several adaptive local search methods to perform exploitation. First, to make PSO suitable for solving scheduling problems, a ranked-order value (ROV) rule based on a random key technique to convert the continuous position values of particles to job permutations is presented. Second, a multiobjective local search based on the Nawaz-Enscore-Ham heuristic is applied to good solutions with a specified probability to enhance the exploitation ability. Third, to enrich the searching behavior and to avoid premature convergence, a multiobjective local search based on simulated annealing with multiple different neighborhoods is designed, and an adaptive meta-Lamarckian learning strategy is employed to decide which neighborhood will be used. Due to the fusion of multiple different searching operations, good solutions approximating the real Pareto front can be obtained. In addition, MOPSO adopts a random weighted linear sum function to aggregate multiple objectives to a single one for solution evaluation and for guiding the evolution process in the multiobjective sense. Due to the randomness of weights, searching direction can be enriched, and solutions with good diversity can be obtained. Simulation results and comparisons based on a variety of instances demonstrate the effectiveness, efficiency, and robustness of the proposed hybrid algorithm.

[1]  Tong Heng Lee,et al.  Evolving better population distribution and exploration in evolutionary multi-objective optimization , 2006, Eur. J. Oper. Res..

[2]  Andrzej Jaszkiewicz,et al.  Genetic local search for multi-objective combinatorial optimization , 2022 .

[3]  Hisao Ishibuchi,et al.  Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling , 2003, IEEE Trans. Evol. Comput..

[4]  Gary B. Lamont,et al.  Multiobjective evolutionary algorithms: classifications, analyses, and new innovations , 1999 .

[5]  Andreas C. Nearchou,et al.  A novel metaheuristic approach for the flow shop scheduling problem , 2004, Eng. Appl. Artif. Intell..

[6]  Russell C. Eberhart,et al.  Swarm intelligence for permutation optimization: a case study of n-queens problem , 2003, Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706).

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

[8]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

[9]  C.-J. Liao,et al.  Bicriterion scheduling in the two-machine flowshop , 1997 .

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

[11]  Sanja Petrovic,et al.  An Introduction to Multiobjective Metaheuristics for Scheduling and Timetabling , 2004, Metaheuristics for Multiobjective Optimisation.

[12]  Taïcir Loukil,et al.  Solving multi-objective production scheduling problems using metaheuristics , 2005, Eur. J. Oper. Res..

[13]  Jacques Teghem,et al.  Efficiency of interactive multi-objective simulated annealing through a case study , 1998, J. Oper. Res. Soc..

[14]  Hideo Tanaka,et al.  Genetic algorithms for flowshop scheduling problems , 1996 .

[15]  Alejandro Quintero,et al.  Sequential and multi-population memetic algorithms for assigning cells to switches in mobile networks , 2003, Comput. Networks.

[16]  Ludo Gelders,et al.  Solving a bicriterion scheduling problem , 1980 .

[17]  Natalio Krasnogor,et al.  Studies on the theory and design space of memetic algorithms , 2002 .

[18]  Rubén Ruiz,et al.  A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..

[19]  Hisao Ishibuchi,et al.  A multi-objective genetic local search algorithm and its application to flowshop scheduling , 1998, IEEE Trans. Syst. Man Cybern. Part C.

[20]  Maurice Clerc,et al.  The particle swarm - explosion, stability, and convergence in a multidimensional complex space , 2002, IEEE Trans. Evol. Comput..

[21]  Takeshi Yamada,et al.  Genetic Algorithms, Path Relinking, and the Flowshop Sequencing Problem , 1998, Evolutionary Computation.

[22]  Hartmut Stadtler,et al.  Supply chain management and advanced planning--basics, overview and challenges , 2005, Eur. J. Oper. Res..

[23]  Ling Wang,et al.  A modified evolutionary programming for flow shop scheduling , 2003 .

[24]  Rakesh K. Sarin,et al.  Scheduling with multiple performance measures: the one-machine case , 1986 .

[25]  B. J. Lageweg,et al.  A General Bounding Scheme for the Permutation Flow-Shop Problem , 1978, Oper. Res..

[26]  Andrzej Jaszkiewicz,et al.  Do multiple-objective metaheuristics deliver on their promises? A computational experiment on the set-covering problem , 2003, IEEE Trans. Evol. Comput..

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

[28]  Peter Merz,et al.  Memetic algorithms for combinatorial optimization problems : fitness landscapes and effective search strategies , 2006 .

[29]  J. A. Hoogeveen,et al.  Single-machine bicriteria scheduling , 1992 .

[30]  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).

[31]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[32]  C. Rajendran Heuristics for scheduling in flowshop with multiple objectives , 1995 .

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

[34]  Ali Allahverdi,et al.  New heuristics for no-wait flowshops to minimize makespan , 2003, Comput. Oper. Res..

[35]  Mehmet Fatih Tasgetiren,et al.  Particle Swarm Optimization Algorithm for Permutation Flowshop Sequencing Problem , 2004, ANTS Workshop.

[36]  Yih-Long Chang,et al.  A new heuristic for the n-job, M-machine flow-shop problem , 1991 .

[37]  Ling Wang,et al.  A Hybrid Quantum-Inspired Genetic Algorithm for Multiobjective Flow Shop Scheduling , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[38]  Maurice Clerc,et al.  Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem , 2004 .

[39]  Huang Dexian,et al.  Advances in Particle Swarm Optimization Algorithm , 2005 .

[40]  Pablo Moscato,et al.  A memetic algorithm for the total tardiness single machine scheduling problem , 2001, Eur. J. Oper. Res..

[41]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[42]  Ling Wang,et al.  An Effective Hybrid Heuristic for Flow Shop Scheduling , 2003 .

[43]  Kevin Kok Wai Wong,et al.  Classification of adaptive memetic algorithms: a comparative study , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[44]  Alireza Rahimi-Vahed,et al.  A multi-objective particle swarm for a flow shop scheduling problem , 2006, J. Comb. Optim..

[45]  Vinícius Amaral Armentano,et al.  Genetic local search for multi-objective flowshop scheduling problems , 2005, Eur. J. Oper. Res..

[46]  Ling Wang,et al.  A class of order-based genetic algorithm for flow shop scheduling , 2003 .

[47]  William E. Hart,et al.  Recent Advances in Memetic Algorithms , 2008 .

[48]  Andy J. Keane,et al.  Meta-Lamarckian learning in memetic algorithms , 2004, IEEE Transactions on Evolutionary Computation.

[49]  Lawrence Davis,et al.  Job Shop Scheduling with Genetic Algorithms , 1985, ICGA.

[50]  Piotr Czyzżak,et al.  Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization , 1998 .

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

[52]  Eckart Zitzler,et al.  Evolutionary algorithms for multiobjective optimization: methods and applications , 1999 .

[53]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[54]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

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

[56]  Willem Selen,et al.  A Mixed-Integer Goal-Programming Formulation of the Standard Flow-Shop Scheduling Problem , 1986 .

[57]  J. George Shanthikumar,et al.  Scheduling n jobs on one machine to minimize the maximum tardiness with minimum number , 1983, Comput. Oper. Res..

[58]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

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

[60]  Chandrasekharan Rajendran,et al.  Two-Stage Flowshop Scheduling Problem with Bicriteria , 1992 .