A novel chemical reaction optimization for the distributed permutation flowshop scheduling problem with makespan criterion

Ahmadizar, 2010, A hybrid algorithm to minimize makespan for the permutation flow shop scheduling problem, International Journal of Computational Intelligence Systems, 3, 853, 10.1080/18756891.2010.9727747 Baker, 1974 Bargaoui, 2014, Multi-agent model based on tabu search for the permutation flow shop scheduling problem, 519 Campbell, 1970, A heuristic algorithm for the n job, m machine sequencing problem, Management Science, 16, B, 10.1287/mnsc.16.10.B630 Črepinšek, 2013, Exploration and exploitation in evolutionary algorithms: a survey, ACM Computing Surveys (CSUR), 45, 35, 10.1145/2480741.2480752 Fernandez-Viagas, 2015, A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem, International Journal of Production Research, 53, 1111, 10.1080/00207543.2014.948578 Fernandez-Viagas, 2017, A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation, European Journal of Operational Research, 257, 707, 10.1016/j.ejor.2016.09.055 Gao, 2011, A hybrid genetic algorithm for the distributed permutation flowshop scheduling problem, International Journal of Computational Intelligence Systems, 4, 497, 10.1080/18756891.2011.9727808 Gao, 2013, An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem, International Journal of Production Research, 51, 641, 10.1080/00207543.2011.644819 Graham, 1979, Optimization and approximation in deterministic sequencing and scheduling: A survey, Annals of Discrete Mathematics, 5, 287, 10.1016/S0167-5060(08)70356-X Gupta, 2006, Flowshop scheduling research after five decades, European Journal of Operational Research, 169, 699, 10.1016/j.ejor.2005.02.001 James, 2014, Chemical reaction optimization for the set covering problem, 512 James, 2015, Adaptive chemical reaction optimization for global numerical optimization, 3192 Jemni, 2011, Solving the permutation flow shop problem with makespan criterion using grids, International Journal of Grid and Distributed Computing, 4, 53 Johnson, 1954, Optimal two-and three-stage production schedules with setup times included, Naval Research Logistics (NRL), 1, 61, 10.1002/nav.3800010110 Kahn, 2012 Komaki, 2015, A general variable neighborhood search algorithm to minimize makespan of the distributed permutation flowshop scheduling problem, World Academy of Science, Engineering and Technology, International Journal of Social, Behavioral, Educational, Economic, Business and Industrial Engineering, 9, 2701 Lam, 2010, Chemical-reaction-inspired metaheuristic for optimization, IEEE Transactions on Evolutionary Computation, 14, 381, 10.1109/TEVC.2009.2033580 Lam, 2012, Chemical reaction optimization: A tutorial, Memetic Computing, 4, 3, 10.1007/s12293-012-0075-1 Lam, 2013, On the convergence of chemical reaction optimization for combinatorial optimization, IEEE Transactions on Evolutionary Computation, 17, 605, 10.1109/TEVC.2012.2227973 Lin, 2013, Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm, International Journal of Production Research, 51, 5029, 10.1080/00207543.2013.790571 Li, 2012, Chemical-reaction optimization for flexible job-shop scheduling problems with maintenance activity, Applied Soft Computing, 12, 2896, 10.1016/j.asoc.2012.04.012 Liu, 2010, A discrete electromagnetism-like mechanism algorithm for solving distributed permutation flowshop scheduling problem, 156 Liu, 2013, A hybrid discrete artificial bee colony algorithm for permutation flowshop scheduling problem, Applied Soft Computing, 13, 1459, 10.1016/j.asoc.2011.10.024 Marzouki, 2015, Multi agent model based on chemical reaction optimization for flexible job shop problem, 29 Montgomery, 2008 Murata, 1996, Genetic algorithms for flowshop scheduling problems, Computers & Industrial Engineering, 30, 1061, 10.1016/0360-8352(96)00053-8 Naderi, 2010, The distributed permutation flowshop scheduling problem, Computers & Operations Research, 37, 754, 10.1016/j.cor.2009.06.019 Naderi, 2014, A scatter search algorithm for the distributed permutation flowshop scheduling problem, European Journal of Operational Research, 239, 323, 10.1016/j.ejor.2014.05.024 Nawaz, 1983, A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem, Omega, 11, 91, 10.1016/0305-0483(83)90088-9 Ruiz, 2005, A comprehensive review and evaluation of permutation flowshop heuristics, European Journal of Operational Research, 165, 479, 10.1016/j.ejor.2004.04.017 Ruiz, 2007, A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem, European Journal of Operational Research, 177, 2033, 10.1016/j.ejor.2005.12.009 Shao, 2016, A self-guided differential evolution with neighborhood search for permutation flow shop scheduling, Expert Systems with Applications, 51, 161, 10.1016/j.eswa.2015.12.001 Taillard, 1990, Some efficient heuristic methods for the flow shop sequencing problem, European Journal of Operational Research, 47, 65, 10.1016/0377-2217(90)90090-X Truong, 2013, Chemical reaction optimization with greedy strategy for the 0–1 knapsack problem, Applied Soft Computing, 13, 1774, 10.1016/j.asoc.2012.11.048 Wang, 2013, An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problem, International Journal of Production Economics, 145, 387, 10.1016/j.ijpe.2013.05.004