A Pareto-based estimation of distribution algorithm for the multi-objective flexible job-shop scheduling problem

References

• Amiri , M. , Zandieh , M. , Yazdani , M. and Bagheri , A. 2010 . A variable neighbourhood search algorithm for the flexible job-shop scheduling problem . International Journal of Production Research , 48 : 5671 – 5689 .
   Web of Science ®Google Scholar
• Baluja, S., 1994. Population-based incremental learning: a method for integrating genetic search based function optimization and competitive learning. Technical Report CMU-CS-94–163. Pittsburgh, PA: Carnegie Mellon University.
   Google Scholar
• Baluja, S., and S. Davies. Using optimal dependency-trees for combinatorial optimization: Learning the structure of the search space. In: Proc of the 14th Int Conf on Machine Learning. San Francisco, 1997, 30–38.
   Google Scholar
• Brandimarte , P. 1993 . Routing and scheduling in a flexible job shop by tabu search . Annals of Operations Research , 41 : 157 – 183 .
   Google Scholar
• Bruker , P. and Schlie , R. 1990 . Job-shop scheduling with multi-purpose machines . Computing , 45 : 369 – 375 .
   Web of Science ®Google Scholar
• Cesar , R.M. , Bengoetxea , E. , Bloch , I. and Larranaga , P. 2005 . Inexact graph matching for model-based recognition: Evaluation and comparison of optimization algorithms . Pattern Recognit , 38 : 2099 – 2113 .
   Web of Science ®Google Scholar
• Chen , S.H. , Chen , M.C. , Chang , P.C. , Zhang , Q.F. and Chen , Y.M. 2010 . Guidelines for developing effective estimation of distribution algorithms in solving single machine scheduling problems . Expert Systems with Applications , 37 : 6441 – 6451 .
   Web of Science ®Google Scholar
• Dauzere-Peres , S. and Paulli , J. 1997 . An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search . Annals of Operations Research , 70 : 281 – 306 .
   Web of Science ®Google Scholar
• Deb , K. , Agrawal , S. , Pratab , A. and Meyarivan , T. 2000 . A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II . Lecture Notes in Computer Science , 1917 : 849 – 858 .
   Google Scholar
• De Bonet, J.S., C.L. Isbell, Jr. and P. Viola. MIMIC: Finding optima by estimating probability densities. Advances in Neural Information Processing Systems, Cambridge: MIT Press, 1997, 424–430.
   Google Scholar
• Frutos , M. , Olivera , A.C. and Tohme , F. 2010 . A memetic algorithm based on a NSGAII scheme for the flexible job-shop scheduling problem . Annals of Operations Research , 181 : 745 – 765 .
   Web of Science ®Google Scholar
• Gao , J. , Sun , L.Y. and Gen , M. 2008 . A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems . Computer & Operations Research , 35 : 2892 – 2907 .
   Web of Science ®Google Scholar
• Gomes , M.C. , Barbosa-Póvoab , A.P. and Novaisc , A.Q. 2005 . Optimal scheduling for flexible job shop operation . International Journal of Production Research , 43 : 2323 – 2353 .
   Web of Science ®Google Scholar
• Harik, G., 1999. Linkage learning via probabilistic modeling in the ECGA. Illigal Report NO. 99010, Illinois Genetic Algorithms Lboratory. Illinois: University of Illinois at Urbana-Champaign.
   Google Scholar
• Harik, G.R., F.G. Lobo, and D.E.,Goldberg. The compact genetic algorithm. In: Proc of the IEEE Conf on Evolutionary Computation. Indianapolis, 1998, 523–528.
   Google Scholar
• Jarboui , B. , Eddaly , M. and Siarry , P. 2009 . An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems . Computer & Operations Research , 36 : 2638 – 2646 .
   Web of Science ®Google Scholar
• Kacem , I. , Hammadi , S. and Borne , P. 2002 . Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic . Mathematics and Computers in Simulation , 60 : 245 – 276 .
   Web of Science ®Google Scholar
• Larranaga , P. and Lozano , J.A. 2002 . Estimation of distribution algorithms: A new tool for evolutionary computation , Boston : Kluwer Press .
   Google Scholar
• Lawler , E.L. , Lenstra , J.K. , Rinnooy Kan , A.H.G. and Shmoys , D.B. 1993 . “ Sequencing and scheduling: Algorithms and complexity ” . In Logistics of production and inventory 45 – 522 . london
   Google Scholar
• Li , J.Q. , Pan , Q.K. and Gao , K.Z. 2011 . Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems . International Journal of Advanced Manufacturing Technology , 55 : 1159 – 1169 .
   Web of Science ®Google Scholar
• Li , J.Q. , Pan , Q.K. and Chen , J. 2012 . A hybrid Pareto-based local search algorithm for multi-objective flexible job shop scheduling problems . International Journal of Production Research , 50 : 1063 – 1078 .
   Web of Science ®Google Scholar
• Li , J.Q. , Pan , Q.K. and Liang , Y.C. 2010 . An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems . Computers & Industrial Engineering , 59 : 647 – 662 .
   Web of Science ®Google Scholar
• Mastrolilli , M. and Gambardella , L.M. 2000 . Effective neighborhood functions for the flexible job shop problem . J of Scheduling , 3 : 3 – 20 .
   Google Scholar
• Mühlenbein , H. and Paass , G. 1996 . From recombination of genes to the estimation of distributions I binary parameters . Lecture Notes in Computer Science, 1141 , : 178 – 187 .
   Google Scholar
• Montgomery , D.C. 2005 . Design and analysis of experiments , Arizona : John Wiley and Sons .
   Google Scholar
• Moslehi , G. and Mahnam , M. 2011 . A pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search . International Journal of Production Economics , 129 : 14 – 22 .
   Web of Science ®Google Scholar
• Mühlenbein , H. and Mahnig , T. 1999 . Convergence theory and applications of the factorized distribution algorithm . Jounal of Computing and Information Technology , 7 : 19 – 32 .
   Google Scholar
• Pelikan , M. , Goldberg , D.E. and Cantú-Paz , E. 1999 . “ BOA: The bayesian optimization algorithm ” . In Proc of the Genetic and Evolutionary Computation 525 – 532 . Orlando
   Google Scholar
• Pelikan , M. and Mühlenbein , H. 1999 . “ The bivariate marginal distribution algorithm ” . In Advances in Soft Computing: Engineering Design and Manufacturing , Edited by: Benítez , J.M. 521 – 535 . London : Springer-Verlag .
   Google Scholar
• Pezzella , F. , Morganti , G. and Ciaschetti , G. 2008 . A genetic algorithm for the flexible job-shop scheduling problem . Computers & Operations Research , 35 : 3202 – 3212 .
   Web of Science ®Google Scholar
• Rabieea, M., M. Zandiehb, and P. Ramezania. Bi-objective partial flexible job shop scheduling problem: NSGA-II, NRGA, MOGA and PAES approaches. International Journal of Production Research, 2012, DOI: 10.1080/ 00207543.2011.648280.
   Google Scholar
• Saeys , Y. , Degroeve , S. , Aeyels , D. Van , de Peer , Y. and Rouze , P. 2003 . Fast feature selection using a simple estimation of distribution algorithm: a case study on splice site prediction . Bioinformatics , 19 : 179 – 188 .
   Web of Science ®Google Scholar
• Sagarna , R. and Lozano , J. 2005 . On the performance of estimation of distribution algorithms applied to software testing . Applied Artificial Intelligence , 19 : 457 – 489 .
   Web of Science ®Google Scholar
• Tay , J.C. and Ho , N.B. 2008 . Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems . Computers & Industrial Engineering , 54 : 453 – 473 .
   Web of Science ®Google Scholar
• Wang , L. and Fang , C. 2012 . An effective estimation of distribution algorithm for the multi-mode resource-constrained project scheduling problem . Computer & Operations Research , 39 : 449 – 460 .
   Web of Science ®Google Scholar
• Wang , L. , Wang , S.Y. and Fang , C. 2012a . A hybrid estimation of distribution algorithm for solving multidimensional knapsack problem . Expert Systems with Applications , 39 : 5593 – 5599 .
   Web of Science ®Google Scholar
• Wang , L. , Wang , S.Y. , Xu , Y. , Zhou , G. and Liu , M. 2012b . A bi-population based estimation of distribution algorithm for the flexible job-shop scheduling problem . Computers & Industrial Engineering , 62 : 917 – 926 .
   Web of Science ®Google Scholar
• Wang , S.J. , Zhou , B.H. and Xi , L.F. 2008 . A filtered-beam-search-based heuristic algorithm for flexible job-shop scheduling problem . International Journal of Production Research , 46 : 3027 – 3058 .
   Web of Science ®Google Scholar
• Wang , X.J. , Gao , L. , Zhang , C.Y. and Shao , X.Y. 2010 . A multi-objective genetic algorithm based on immune and entropy principle for flexible job-shop scheduling problem . International Journal of Advanced Manufacturing Technology , 51 : 757 – 767 .
   Web of Science ®Google Scholar
• Xia , W.J. and Wu , Z.M. 2005 . An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems . Computers & Industrial Engineering , 48 : 409 – 425 .
   Web of Science ®Google Scholar
• Xing , L.N. , Chen , Y.W. , Wang , P. , Zhao , Q.S. and Xiong , J. 2010 . A knowledge-based ant colony optimization for flexible job shop scheduling problems . Applied Soft Computing , 10 : 888 – 896 .
   Web of Science ®Google Scholar
• Xing , L.N. , Chen , Y.W. and Yang , K.W. 2009 . An efficient search method for multi-objective flexible job shop scheduling problems . Journal of Intelligent Manufacturing , 20 : 283 – 293 .
   Web of Science ®Google Scholar
• Yazdani , M. , Amiri , M. and Zandieh , M. 2010 . Flexible job-shop scheduling with parallel variable neighborhood search algorithm . Expert Systems with Applications , 37 : 678 – 687 .
   Web of Science ®Google Scholar