Multi-Objective Artificial Bee Colony Algorithms and Chaotic-TOPSIS Method for Solving Flowshop Scheduling Problem and Decision Making

Retrieval of optimal solution(s) for a permutation flowshop scheduling problem within a reasonable computational timeframe has been a challenge till yet. The problem includes optimization of various criterions like makespan, total flowtime, earliness, tardiness, etc and obtaining a Pareto solution for final decision making. This paper remodels a discrete artificial bee colony algorithm for permutation flowshop scheduling problem executed through three different scenarios raised the analysis of time complexity measure. To enhance the search procedure, we have explored the alternative and combined use of two local search algorithms named as: iterated greedy search algorithm and iterated local search algorithm in our discrete artificial bee colony algorithm and the results are summarized with respect to completion time, mean weighted tardiness, and mean weighted earliness. The two algorithms are prioritised on insertion and swap of neighbourhood structures which will intensify the local optima in the search space. Further the performance of the algorithm is compared with the test results of multi-objective artificial bee colony algorithm. The result of our optimization process concludes with a set of non-dominated solutions lead to different Pareto fronts. Finally, we propose a chaotic based technique for order of preference by similarity to ideal solution (chaotic-TOPSIS) using a suitable chaotic map for criteria adaptation in order to enhance the decision accuracy in the multi-objective problem domain.

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

[2]  D. S. Palmer.  Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .

[3]  E. Ignall,et al.  Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems , 1965 .

[4]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .

[5]  Jatinder N. D. Gupta,et al.  A Functional Heuristic Algorithm for the Flowshop Scheduling Problem , 1971 .

[6]  Kailash C. Kapur,et al.  An Algorithm for Solving Multicriterion Linear Programming Problems with Examples , 1973 .

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

[8]  Milan Zelany,et al.  A concept of compromise solutions and the method of the displaced ideal , 1974, Comput. Oper. Res..

[9]  S. Bansal.  Minimizing the Sum of Completion Times of n Jobs over m Machines in a Flowshop—A Branch and Bound Approach , 1977 .

[10]  David G. Dannenbring,et al.  An Evaluation of Flow Shop Sequencing Heuristics , 1977 .

[11]  Bertrand Mareschal,et al.  Weight stability intervals in multicriteria decision aid , 1988 .

[12]  S. L. Velde.  Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation , 1991 .

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

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

[15]  Gyutai Kim,et al.  Identifying investment opportunities for advanced manufacturing systems with comparative-integrated performance measurement , 1997 .

[16]  Jian-Bo Yang,et al.  Multiple Attribute Decision Making , 1998 .

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

[18]  Chandrasekharan Rajendran,et al.  A heuristic for scheduling in a flowshop with the bicriteria of makespan and maximum tardiness minimization , 1999 .

[19]  Tapan P. Bagchi,et al.  Multiobjective Flowshop Scheduling , 1999 .

[20]  Valery Tereshko,et al.  Reaction-Diffusion Model of a Honeybee Colony's Foraging Behaviour , 2000, PPSN.

[21]  M.A. El-Sharkawi,et al.  Swarm intelligence for routing in communication networks , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[22]  N. Monmarché,et al.  An Ant Colony Optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem , 2002, Eur. J. Oper. Res..

[23]  Christine W. Chan,et al.  USING MULTIPLE CRITERIA DECISION ANALYSIS FOR SUPPORTING DECISIONS OF SOLID WASTE MANAGEMENT , 2002, Journal of environmental science and health. Part A, Toxic/hazardous substances & environmental engineering.

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

[25]  Huanwen Tang,et al.  Application of chaos in simulated annealing , 2004 .

[26]  R. Suresh,et al.  Pareto archived simulated annealing for permutation flow shop scheduling with multiple objectives , 2004, IEEE Conference on Cybernetics and Intelligent Systems, 2004..

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

[28]  Chandrasekharan Rajendran,et al.  A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs , 2005, Eur. J. Oper. Res..

[29]  Dervis Karaboga,et al.  AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION , 2005 .

[30]  Dervis Karaboga,et al.  A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm , 2007, J. Glob. Optim..

[31]  S. G. Ponnambalam,et al.  Multi-objective particle swarm optimization algorithm for scheduling in flowshops to minimize makespan, total flowtime and completion time variance , 2007, 2007 IEEE Congress on Evolutionary Computation.

[32]  D. Karaboga,et al.  On the performance of artificial bee colony (ABC) algorithm , 2008, Appl. Soft Comput..

[33]  Seyed Jafar Sadjadi,et al.  An Ant Colony Algorithm for the Flowshop Scheduling Problem , 2008 .

[34]  B. Lina,et al.  Development of new features of ant colony optimization for flowshop scheduling $ , 2008 .

[35]  Mehmet Mutlu Yenisey,et al.  Ant colony optimization for multi-objective flow shop scheduling problem , 2008, Comput. Ind. Eng..

[36]  Leandro dos Santos Coelho,et al.  Use of chaotic sequences in a biologically inspired algorithm for engineering design optimization , 2008, Expert Syst. Appl..

[37]  Dervis Karaboga,et al.  A survey: algorithms simulating bee swarm intelligence , 2009, Artificial Intelligence Review.

[38]  Nurhan Karaboga,et al.  A new design method based on artificial bee colony algorithm for digital IIR filters , 2009, J. Frankl. Inst..

[39]  Wei Gong,et al.  Chaos Ant Colony Optimization and Application , 2009, 2009 Fourth International Conference on Internet Computing for Science and Engineering.

[40]  Dervis Karaboga,et al.  A comparative study of Artificial Bee Colony algorithm , 2009, Appl. Math. Comput..

[41]  Bilal Alatas,et al.  Chaotic harmony search algorithms , 2010, Appl. Math. Comput..

[42]  Fahime Moein-darbari,et al.  Scheduling of scientific workflows using a chaos-genetic algorithm , 2010, ICCS.

[43]  Bilal Alatas,et al.  Chaotic bee colony algorithms for global numerical optimization , 2010, Expert Syst. Appl..

[44]  Kannan Govindan,et al.  A multi-objective simulated annealing algorithm for permutation flow shop scheduling problem , 2011, Int. J. Adv. Oper. Manag..

[45]  Mehmet Fatih Tasgetiren,et al.  A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops , 2011, Inf. Sci..

[46]  Dervis Karaboga,et al.  A comprehensive survey: artificial bee colony (ABC) algorithm and applications , 2012, Artificial Intelligence Review.

[47]  A. Gandomi,et al.  Imperialist competitive algorithm combined with chaos for global optimization , 2012 .

[48]  Harish Sharma,et al.  Artificial bee colony algorithm: a survey , 2013, Int. J. Adv. Intell. Paradigms.

[49]  Xin-She Yang,et al.  Firefly algorithm with chaos , 2013, Commun. Nonlinear Sci. Numer. Simul..

[50]  Amir Hossein Gandomi,et al.  Chaotic bat algorithm , 2014, J. Comput. Sci..

[51]  Xing-sheng Gu,et al.  An effective discrete artificial bee colony algorithm for flow shop scheduling problem with intermediate buffers , 2015 .

[52]  Yang Li,et al.  A New Method Based on TOPSIS and Response Surface Method for MCDM Problems with Interval Numbers , 2015 .

[53]  Xiangtao Li,et al.  Multi-Objective Memetic Search Algorithm for Multi-Objective Permutation Flow Shop Scheduling Problem , 2016, IEEE Access.

[54]  Neelam Tyagi,et al.  Three Machines Flowshop Scheduling Model with Bicriterion Objective Function , 2016 .

[55]  Christian Wagner,et al.  An exploration of issues and limitations in current methods of TOPSIS and fuzzy TOPSIS , 2016, 2016 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE).

[56]  Khalil Md Nor,et al.  Development of TOPSIS Method to Solve Complicated Decision-Making Problems - An Overview on Developments from 2000 to 2015 , 2016, Int. J. Inf. Technol. Decis. Mak..

[57]  Mostafa Zandieh,et al.  Bi-objective scheduling for the re-entrant hybrid flow shop with learning effect and setup times , 2017 .

[58]  Ergun Uzlu,et al.  The estimation of flood quantiles in ungauged sites using teaching-learning based optimization and artificial bee colony algorithms , 2017 .

[59]  C. Guedes Soares,et al.  Incorporating evidential reasoning and TOPSIS into group decision-making under uncertainty for handling ship without command , 2018, Ocean Engineering.

[60]  Seyed Jafar Sadjadi,et al.  A stochastic multi-objective model based on the classical optimal search model for searching for the people who are lost in response stage of earthquake , 2018 .

[61]  Minghao Yin,et al.  A novel fuzzy model for multi-objective permutation flow shop scheduling problem with fuzzy processing time , 2019 .