A discrete artificial bee colony algorithm with composite mutation strategies for permutation flow shop scheduling problem

Stadtler, 2005, Supply chain management and advanced planning basics, overview and challenges, European Journal of Operation Research, 163, 575, 10.1016/j.ejor.2004.03.001 Garey, 1979 Rinnooy Kan, 1976 Johnson, 1954, Optimal two-and three-stage production schedules, Naval Research Logistics Quarterly, 1, 61, 10.1002/nav.3800010110 Bansal, 1977, Minimizing the sum of completion times of n-jobs over M-machines in a flowshop—a branch and bound approach, AIIE Transactions, 9, 306, 10.1080/05695557708975160 Croce, 1996, The two-machine total completion time flow shop problem, European Journal of Operational Research, 90, 227, 10.1016/0377-2217(95)00351-7 Croce, 2002, An improved branch-and-bound algorithm for the two machine total completion time flow shop problem, European Journal of Operational Research, 139, 293, 10.1016/S0377-2217(01)00374-5 Ignall, 1965, Application of the branch and bound technique to some flowshop scheduling problem, Operations Research, 13, 400, 10.1287/opre.13.3.400 Stafford, 1988, On the development of a mixed integer linear programming model for the flowshop sequencing problem, Journal of the Operational Research Society, 39, 1163, 10.1057/jors.1988.193 Liu, 2007, An effective PSO-based memetic algorithm for flow shop scheduling, IEEE Transaction Systems, Man, Cybernetics-Part B, 37, 18, 10.1109/TSMCB.2006.883272 Nagano, 2002, A high quality solution constructive heuristic for flow shop sequencing, Journal of the Operational Research Society, 53, 1374, 10.1057/palgrave.jors.2601466 Kalczynski, 2007, On no-wait and no-idle flow shops with makespan criterion, European Journal of Operational Research, 178, 677, 10.1016/j.ejor.2006.01.036 Nagano, 2008, Reducing mean flow time in permutation flow shop, Journal of the Operational Research Society, 59, 939, 10.1057/palgrave.jors.2602395 Campbell, 1970, A heuristic algorithm for the n job, m machine sequencing problem, Management Science, 16, 630, 10.1287/mnsc.16.10.B630 Rajendran, 1993, Heuristic algorithm for scheduling in a flowshop to minimize total flowtime, International Journal of Production Economics, 29, 65, 10.1016/0925-5273(93)90024-F 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 Taillard, 1990, Some efficient heuristic methods for the flowshop sequencing problems, European Journal of Operational Research, 47, 65, 10.1016/0377-2217(90)90090-X Framinan, 2003, An efficient constructive heuristic for flowtime minimization in permutation flow shops, OMEGA, 31, 311, 10.1016/S0305-0483(03)00047-1 Ogbu, 1990, The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem, Computers & Operations Research, 17, 243, 10.1016/0305-0548(90)90001-N Osman, 1989, Simulated annealing for permutation flow shop scheduling, OMEGA, 17, 551, 10.1016/0305-0483(89)90059-5 Nagano, 2008, A constructive genetic algorithm for permutation flowshop scheduling, Computers & Industrial Engineering, 55, 195, 10.1016/j.cie.2007.11.018 Reeves, 1998, Genetic algorithms, path relinking and the flowshop sequencing problem, Evolutionary Computation, 6, 45, 10.1162/evco.1998.6.1.45 Ribeiro Filho, 2007, Evolutionary clustering search for flowtime minimization in permutation flow shop, Lecture Notes in Computer Science, 4771, 69, 10.1007/978-3-540-75514-2_6 Tasgetiren, 2007, A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem, European Journal of Operational Research, 177, 1930, 10.1016/j.ejor.2005.12.024 Hajinejada, 2011, A fast hybrid particle swarm optimization algorithm for flow shop sequence dependent group scheduling problem, Scientia Iranica, 18, 759, 10.1016/j.scient.2011.05.023 Rajendran, 2004, Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs, European Journal of Operational Research, 155, 426, 10.1016/S0377-2217(02)00908-6 Grabowski, 2004, A very fast tabu search algorithm for the permutation flowshop problem with makespan criterion, Computers & Operations Research, 31, 1891, 10.1016/S0305-0548(03)00145-X Moccellin, 1998, Evaluating the performance of tabu search procedures for flow shop sequencing, Journal of the Operational Research Society, 49, 1296, 10.1057/palgrave.jors.2600633 Revees, 1993, Improving the efficiency of tabu search for machine sequencing problem, Journal of Operational Research Society, 44, 375, 10.1057/jors.1993.67 Imanipour, 2006, A heuristic approach based on tabu search for early/tardy flexible job shop problems, Scientia Iranica, 13, 1 Stützle, T. “Applying iterated local search to the permutation flowshop problem”, Technical Report, AIDA-98-04, Darmstad University of Technology, Computer Science Department, Intellctics Group, Darmstad, Germany (1998). Bassem, 2009, An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems, Computer & Operations Research, 36, 2638, 10.1016/j.cor.2008.11.004 Nearchou, 2004, A novel metaheuristic approach for the flow shop scheduling problem, Engineering Applications of Artificial Intelligence, 17, 289, 10.1016/j.engappai.2004.02.008 Tseng, 2009, A hybrid genetic local search algorithm for the permutation flowshop scheduling problem, European Journal of Operational Research, 198, 84, 10.1016/j.ejor.2008.08.023 Zhang, 2009, Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization, European Journal of Operational Research, 196, 869, 10.1016/j.ejor.2008.04.033 Wang, 2003, An effective hybrid heuristic for flow shop scheduling, The International Journal of Advanced Manufacturing Technology, 21, 38, 10.1007/s001700300005 Murata, 1996, Genetic algorithms for flowshop scheduling problems, Computers & Operations Research, 30, 1061 Dipak, 2007, An efficient stochastic hybrid heuristic for flowshop scheduling, Engineering Application of Artificial Intelligence, 20, 851, 10.1016/j.engappai.2006.10.003 Dong, 2009, An iterated local search algorithm for the permutation flowshop problem with total flowshop crition, Computers & Operation Research, 36, 1664, 10.1016/j.cor.2008.04.001 Zhang, 2008, An improved particle swarm optimization for flow shop scheduling problem, Information Processing Letters, 108, 204, 10.1016/j.ipl.2008.05.010 Kuo, 2009, An efficient flow-shop scheduling algorithm based on a hybrid particle swarm optimization model, Expert Systems with Applications, 36, 7027, 10.1016/j.eswa.2008.08.054 Zhang, 2009, An alternate two phases particle swarm optimization algorithm for flow shop scheduling problem, Expert Systems with Applications, 36, 5162, 10.1016/j.eswa.2008.06.036 Tasgetiren, M.F., Liang, Y.C., Sevkli, M. and Gencyilmaz, G. “Particle swarm optimization algorithm for makespan and maximum lateness minimization in permutation flowshop sequencing problem”, Proceedings of the Fourth International Symposium on Intelligent Manufacturing Systems, Turkey, Sakarya, pp. 431–441 (2004). Zheng, 2010, Solving flow shop scheduling problems by quantum differential evolutionary algorithm, International Journal of Advanced Manufacturing Technology, 49, 643, 10.1007/s00170-009-2438-4 Karaboga, 2007, A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm, Journal of Global Optimization, 39, 459, 10.1007/s10898-007-9149-x Karaboga, 2008, On the performance of artificial bee colony (ABC) algorithm, Applied Soft Computing, 8, 687, 10.1016/j.asoc.2007.05.007 Zou, 2010, A clustering approach using cooperative artificial bee colony algorithm, Discrete Dynamics in Nature and Society, 10.1155/2010/459796 Pan, 2011, A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem, Information Sciences, 18, 2455, 10.1016/j.ins.2009.12.025 Karaboga, D. “An idea based on honey bee swarm for numerical optimization”, Technical Report-TR06, Erciyes University, Engineering Faculty, Computer Engineering Department (2005). Karaboga, 2009, A comparative study of artificial bee colony algorithm, Applied Mathematics and Computation, 214, 108, 10.1016/j.amc.2009.03.090 Nowicki, 1996, A fast tabu search algorithm for the permutation flow-shop problem, European Journal of Operational Research, 91, 160, 10.1016/0377-2217(95)00037-2 Carlier, 1978, Ordonnancements a contraintes disjonctives, R.A.I.R.O. Recherche Operationelle/Oper, 12, 333 Taillard, 1993, Benchmarks for basic scheduling problems, European Journal of Operational Research, 64, 278, 10.1016/0377-2217(93)90182-M Demirkol, 1998, Benchmarks for shop scheduling problems, European Journal of Operational Research, 109, 137, 10.1016/S0377-2217(97)00019-2 Qian, 2008, A hybrid differential evolution method for permutation flow-shop scheduling, The International Journal of Advanced Manufacturing Technology, 38, 757, 10.1007/s00170-007-1115-8 Wang, 2005, A hybrid quantum inspired genetic algorithm for flow shop scheduling, Lecture Notes in Computer Science, 3645, 636, 10.1007/11538356_66 Ruiz, 2006, Two new robust genetic algorithms for the flowshop scheduling problem, OMEGA, the International Journal of Management Science, 34, 461, 10.1016/j.omega.2004.12.006 Widmer, 1989, A new heuristic method for the flow shop sequencing problem, European Journal of Operational Research, 41, 186, 10.1016/0377-2217(89)90383-4 Nearchou, 2004, The effect of various operators on the genetic search for large scheduling problems, International Journal of Production Economics, 88, 191, 10.1016/S0925-5273(03)00184-1 Aldowaisan, 2003, New heuristics for no-wait flowshops to minimize makespan, Computers & Operations Research, 30, 1219, 10.1016/S0305-0548(02)00068-0 Lian, 2008, A novel particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan, Chaos, Solitons & Fractals, 35, 851, 10.1016/j.chaos.2006.05.082 Yagmahan, 2008, Ant colony optimization for multiobjective flow shop scheduling problem, Computers & Industrial Engineering, 54, 411, 10.1016/j.cie.2007.08.003 Liu, 2001, Constructive and composite heuristic solutions to the P∥∑Ci scheduling problem, European Journal of Operational Research, 132, 439, 10.1016/S0377-2217(00)00137-5