A Distance-Based Ranking Model Estimation of Distribution Algorithm for the Flowshop Scheduling Problem

The aim of this paper is two-fold. First, we introduce a novel general estimation of distribution algorithm to deal with permutation-based optimization problems. The algorithm is based on the use of a probabilistic model for permutations called the generalized Mallows model. In order to prove the potential of the proposed algorithm, our second aim is to solve the permutation flowshop scheduling problem. A hybrid approach consisting of the new estimation of distribution algorithm and a variable neighborhood search is proposed. Conducted experiments demonstrate that the proposed algorithm is able to outperform the state-of-the-art approaches. Moreover, from the 220 benchmark instances tested, the proposed hybrid approach obtains new best known results in 152 cases. An in-depth study of the results suggests that the successful performance of the introduced approach is due to the ability of the generalized Mallows estimation of distribution algorithm to discover promising regions in the search space.

[1]  Shigeyoshi Tsutsui,et al.  Probabilistic Model-Building Genetic Algorithms in Permutation Representation Domain Using Edge Histogram , 2002, PPSN.

[2]  Chandrasekharan Rajendran,et al.  Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs , 2004, Eur. J. Oper. Res..

[3]  Xiao Xu,et al.  An asynchronous genetic local search algorithm for the permutation flowshop scheduling problem with total flowtime minimization , 2011, Expert Syst. Appl..

[4]  Martin Pelikan,et al.  Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications (Studies in Computational Intelligence) , 2006 .

[5]  Marina Meila,et al.  Dirichlet Process Mixtures of Generalized Mallows Models , 2010, UAI.

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

[7]  Bassem Jarboui,et al.  A combinatorial particle swarm optimisation for solving permutation flowshop problems , 2008, Comput. Ind. Eng..

[8]  M. Fligner,et al.  Multistage Ranking Models , 1988 .

[9]  Chen Fang,et al.  An effective estimation of distribution algorithm for the multi-mode resource-constrained project scheduling problem , 2012, Comput. Oper. Res..

[10]  J. Kamburowski,et al.  On the NEH heuristic for minimizing the makespan in permutation flow shops , 2007 .

[11]  Thomas Brendan Murphy,et al.  Mixtures of distance-based models for ranking data , 2003, Comput. Stat. Data Anal..

[12]  P.-C.-F. Daunou,et al.  Mémoire sur les élections au scrutin , 1803 .

[13]  Marcelo Seido Nagano,et al.  A Constructive Genetic Algorithm for Permutation Flowshop Scheduling Version 2 , 2007 .

[14]  Xiaoping Li,et al.  Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization , 2009, Eur. J. Oper. Res..

[15]  Alexander Mendiburu,et al.  Introducing the Mallows Model on Estimation of Distribution Algorithms , 2011, ICONIP.

[16]  Marco César Goldbarg,et al.  New VNS heuristic for total flowtime flowshop scheduling problem , 2012, Expert Syst. Appl..

[17]  Pedro Larrañaga,et al.  Protein Folding in Simplified Models With Estimation of Distribution Algorithms , 2008, IEEE Transactions on Evolutionary Computation.

[18]  L. Thurstone.  A law of comparative judgment. , 1994 .

[19]  Bassem Jarboui,et al.  An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems , 2009, Comput. Oper. Res..

[20]  C. Rajendran.  Heuristic algorithm for scheduling in a flowshop to minimize total flowtime , 1993 .

[21]  Jatinder N. D. Gupta,et al.  Flowshop scheduling research after five decades , 2006, Eur. J. Oper. Res..

[22]  C. Rajendran,et al.  An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops , 2006 .

[23]  C. Rajendran,et al.  An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs , 1997 .

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

[25]  Pedro Larrañaga,et al.  Estimation of Distribution Algorithms , 2002, Genetic Algorithms and Evolutionary Computation.

[26]  Thomas Stützle,et al.  An Ant Approach to the Flow Shop Problem , 1998 .

[27]  Marina Meila,et al.  Experiments with Kemeny ranking: What works when? , 2012, Math. Soc. Sci..

[28]  Pin Luarn,et al.  A discrete version of particle swarm optimization for flowshop scheduling problems , 2007, Comput. Oper. Res..

[29]  Ömer Kirca,et al.  A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems , 2002 .

[30]  Lin-Yu Tseng,et al.  A hybrid genetic local search algorithm for the permutation flowshop scheduling problem , 2009, Eur. J. Oper. Res..

[31]  David E. Goldberg,et al.  Node Histogram vs . Edge Histogram : A Comparison of PMBGAs in Permutation Domains , 2006 .

[32]  Jose M. Framiñan,et al.  Comparison of heuristics for flowtime minimisation in permutation flowshops Technical report IO-2003 / 01 Version 0 . 5 Last version : 26 / 07 / 2003 , 2004 .

[33]  S. García,et al.  An Extension on "Statistical Comparisons of Classifiers over Multiple Data Sets" for all Pairwise Comparisons , 2008 .

[34]  J. Borwein,et al.  Pi and the AGM: A Study in Analytic Number Theory and Computational Complexity , 1998 .

[35]  Stanley F. Bullington,et al.  An effective heuristic for flow shop problems with total flow time as criterion , 1993 .

[36]  E. Hüllermeier,et al.  A Simple Instance-Based Approach to Multilabel Classification Using the Mallows Model , 2009 .

[37]  Tayuan Huang,et al.  Metrics on Permutations, a Survey , 2004 .

[38]  A. Culyer.  Thurstone’s Law of Comparative Judgment , 2014 .

[39]  J. Framiñan,et al.  An efficient constructive heuristic for flowtime minimisation in permutation flow shops , 2003 .

[40]  John D. Lafferty,et al.  Cranking: Combining Rankings Using Conditional Probability Models on Permutations , 2002, ICML.

[41]  Yi Mao,et al.  Non-parametric Modeling of Partially Ranked Data , 2007, NIPS.

[42]  Martin Pelikan,et al.  Scalable Optimization via Probabilistic Modeling , 2006, Studies in Computational Intelligence.

[43]  Jean-Marie Proth,et al.  A branch-and-bound algorithm for n-job two machine flow shop scheduling problems , 1995, Proceedings 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation. ETFA'95.

[44]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[45]  C. L. Mallows.  NON-NULL RANKING MODELS. I , 1957 .

[46]  Shih-Hsin Chen,et al.  Addressing the advantages of using ensemble probabilistic models in Estimation of Distribution Algorithms for scheduling problems , 2013 .

[47]  Jung Woo Jung,et al.  Flowshop-scheduling problems with makespan criterion: a review , 2005 .

[48]  Colin R. Reeves,et al.  Improving the Efficiency of Tabu Search for Machine Sequencing Problems , 1993 .

[49]  Liang Gao,et al.  A hybrid particle swarm optimization with estimation of distribution algorithm for solving permutation flowshop scheduling problem , 2011, Expert Syst. Appl..

[50]  J. A. Lozano,et al.  Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .

[51]  Ali Allahverdi,et al.  New heuristics to minimize total completion time in m-machine flowshops , 2002 .

[52]  Quan-Ke Pan,et al.  An estimation of distribution algorithm for lot-streaming flow shop problems with setup times , 2012 .

[53]  Hoon-Shik Woo,et al.  A heuristic algorithm for mean flowtime objective in flowshop scheduling , 1998, Comput. Oper. Res..

[54]  Marina Meila,et al.  Tractable Search for Learning Exponential Models of Rankings , 2009, AISTATS.

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

[56]  Qingfu Zhang,et al.  An evolutionary algorithm with guided mutation for the maximum clique problem , 2005, IEEE Transactions on Evolutionary Computation.

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

[58]  Alexander Mendiburu,et al.  A review on estimation of distribution algorithms in permutation-based combinatorial optimization problems , 2012, Progress in Artificial Intelligence.

[59]  M. Fligner,et al.  Distance Based Ranking Models , 1986 .

[60]  Pedro Larrañaga,et al.  Towards a New Evolutionary Computation - Advances in the Estimation of Distribution Algorithms , 2006, Towards a New Evolutionary Computation.

[61]  Jeff A. Bilmes,et al.  Consensus ranking under the exponential model , 2007, UAI.

[62]  Craig Boutilier,et al.  Learning Mallows Models with Pairwise Preferences , 2011, ICML.

[63]  Q. Wang,et al.  Efficient composite heuristics for total flowtime minimization in permutation flow shops , 2009 .

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

[65]  M. Trick,et al.  Voting schemes for which it can be difficult to tell who won the election , 1989 .

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

[67]  Qingfu Zhang,et al.  Estimation of Distribution Algorithm with 2-opt Local Search for the Quadratic Assignment Problem , 2006, Towards a New Evolutionary Computation.

[68]  Xiaoping Li,et al.  Composite heuristic algorithm for permutation flowshop scheduling problems with total flowtime minimization , 2008, 2008 12th International Conference on Computer Supported Cooperative Work in Design.

[69]  Jiyin Liu,et al.  Constructive and composite heuristic solutions to the P// Sigma Ci scheduling problem , 2001, Eur. J. Oper. Res..

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

[71]  Ping Chen,et al.  An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion , 2009, Comput. Oper. Res..

[72]  Yuan Yan Tang,et al.  Directed connection measurement for evaluating reconstructed stroke sequence in handwriting images , 2005, Pattern Recognit..

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

[74]  Xiaoping Li,et al.  Similarity based ant-colony algorithm for permutation flowshop scheduling problems with total flowtime minimization , 2009, 2009 13th International Conference on Computer Supported Cooperative Work in Design.