Solving permutation flowshop scheduling problems with a discrete differential evolution algorithm

AI Communications

Volumn 29, Issue 2, 2016, Pages 269-286

  Santucci, Valentino ^a   Baioletti, Marco ^a   Milani, Alfredo ^a,b  

^a UNIVERSITY OF PERUGIA   (Italy)

^b HONG KONG BAPTIST UNIVERSITY   (Hong Kong)

Author keywords

differential evolution; Permutation flowshop scheduling problem; permutation based optimization

Indexed keywords

OPTIMIZATION; SCHEDULING;

DIFFERENTIAL EVOLUTION; DIFFERENTIAL MUTATIONS; DISCRETE DIFFERENTIAL EVOLUTION ALGORITHM; DISCRETE DIFFERENTIAL EVOLUTIONS; PERMUTATION FLOWSHOP SCHEDULING PROBLEMS; STATE OF THE ART; STATE-OF-THE-ART ALGORITHMS; TOTAL FLOWTIME;

EVOLUTIONARY ALGORITHMS;

EID: 84960350951     PISSN: 09217126     EISSN: None     Source Type: Journal    
DOI: 10.3233/AIC-150695     Document Type: Article

References (39)

1. M. Baioletti, A. Milani, V. Poggioni and F. Rossi, Experimental evaluation of pheromone models in ACOPlan, Annals of Mathematics and Artificial Intelligence 62(3) (2011), 187-217.
2. M. Baioletti, A. Milani and V. Santucci, A discrete differential evolution algorithm for multi-objective permutation flowshop scheduling, in: Proceedings of IPS 2015-Italian Workshop on Planning and Scheduling, 2015, pp. 80-87.
3. M. Baioletti, A. Milani and V. Santucci, Linear ordering optimization with a combinatorial differential evolution, in: Proceedings of IEEE Intern. Conf. on Systems, Man, and Cybernetics (SMC), 2015, pp. 2135-2140.
4. M. Birattari, Tuning Metaheuristics: A Machine Learning Perspective, Springer-Verlag, Berlin, 2009.
5. J. Brest, B. Boskovic, M. Mernik and V. Zumer, Self-adapting control parameters in differential evolution: A comparative study on numerical benchmark problems, IEEE Transactions on Evolutionary Computation 10(6) (2006), 646-657.
6. J. Ceberio, E. Irurozki, A. Mendiburu and J.A. Lozano, A distance-based ranking model estimation of distribution algorithm for the flowshop scheduling problem, IEEE Transactions on Evolutionary Computation 99(2) (2013), 1-16.
7. Z. Cickova and S. Stevo, Flow shop scheduling using differential evolution, Management Information Systems 5(2) (2010), 8-13.
8. W.E. Costa, M.C. Goldbarg and E.G. Goldbarg, New VNS heuristic for total flowtime flowshop scheduling problem, Expert Systems with Applications 39(9) (2012), 8149-8161.
9. J. Derrac, S. Garcia, D. Molina and F. Herrera, A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms, Swarm and Evolutionary Computation 1(1) (2011), 3-18.
10. S. Fisher and F Yates, Statistical Tables, Oliver & Boyd, Edinburgh, 1943.
11. F Glover, M. Laguna and R. Marti, Fundamentals of scatter search and path relinking, Control and Cybernetics 29(3) (2000), 653-684.
12. T. Gonzalez and S. Sahni, Flowshop and jobshop schedules: Complexity and approximation, Operations Research 26(1) (1978), 36-52.
13. J. Gupta and J.E. Stafford, Flowshop scheduling research after five decades, European Journal of Operational Research 169(3) (2006), 699-711.
14. I.N. Herstein, Topics in Algebra, 2nd edn, John Wiley & Sons, 1975.
15. X. Li, Q. Wang and C. Wu, Efficient composite heuristics for total flowtime minimization in permutation flow shops, Omega 37(1) (2009), 155-164.
16. X. Li and M. Yin, An opposition-based differential evolution algorithm for permutation flow shop scheduling based on diversity measure, Advances in Engineering Software 55 (2013), 10-31.
17. S.W. Lin and K.C. Ying, Minimizing makespan and total flow-time in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm, Computers & Operations Research 40(6) (2013), 1625-1647.
18. J. Liu and C.R. Reeves, Constructive and composite heuristic solutions to the n/m/P/J] Ci scheduling problem, European Journal of Operational Research 132(2) (2001), 439-452.
19. A. Milani and V. Santucci, Community of scientist optimization: An autonomy oriented approach to distributed optimization, AI Commununications 25(2) (2012), 157-172.
20. G. Minella, R. Ruiz and C. Ciavotta, A review and evaluation of multiobjective algorithms for the flowshop scheduling problem, INFORMS Journal on Computing 20(3) (2008), 451-471.
21. E. Mokotoff, Multi-objective simulated annealing for permutation flow shop problems, in: Computational Intelligence in Flow Shop and Job Shop Scheduling, Vol. 230, 2009, pp. 101-150.
22. T. Murata, H. Ishibuchi and H. Tanaka, Genetic algorithms for flowshop scheduling problems, Computers & Industrial Engineering 30(4) (1996), 1061-1071.
23. M. Nawaz, E.E. Enscore and I. Ham, A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem, Omega 11(1) (1983), 91-95.
24. G.C. Onwubolu and D. Davendra, Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization, Springer-Verlag, Berlin, 2009.
25. Q.K. Pan and R. Ruiz, A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime, Computers & Industrial Engineering 55(4) (2013), 795-816.
26. K.V. Price, R.M. Storn and J.A. Lampinen, Differential Evolution: A Practical Approach to Global Optimization, Springer-Verlag, Berlin, 2005.
27. C. Rajendran and H. Ziegler, A multi-objective ant-colony algorithm for permutation flowshop scheduling to minimize the makespan and total flowtime of jobs, in: Computational Intelligence in Flow Shop and Job Shop Scheduling, Vol. 230, 2009, pp. 53-99.
28. F. Rothlauf, Representations for Genetic and Evolutionary Algorithms, Springer-Verlag, Berlin, 2006.
29. R. Ruiz and C. Maroto, A comprehensive review and evaluation of permutation flowshop heuristics, European Journal of Operational Research 165(2) (2005), 479-494.
30. R. Ruiz and T. Stutzle, A simple and effective iterated greedy algorithm for the permutation Flowshop Scheduling Problem, European Journal of Operational Research 177(3) (2007), 2033-2049.
31. V. Santucci, M. Baioletti and A. Milani, A discrete differential evolution algorithm for the total flowtime flowshop scheduling problem, in: Proceedings of 21st RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, 2014.
32. V. Santucci, M. Baioletti and A. Milani, A differential evolution algorithm for the permutation flowshop scheduling problem with total flow time criterion, in: Parallel Problem Solving from Nature-PPSN XIII, Vol. 8672, 2014, pp. 161-170.
33. V. Santucci, M. Baioletti and A. Milani, An algebraic differential evolution for the linear ordering problem, in: GECCO Companion'15, pp. 1479-1480.
34. V. Santucci, M. Baioletti and A. Milani, Algebraic differential evolution algorithm for the permutation flow-shop scheduling problem with total flowtime criterion, IEEE Transactions on Evolutionary Computation, to appear. doi:10.1109/TEVC.2015.2507785.
35. T. Schiavinotto and T. Stutzle, A review of metrics on permutations for search landscape analysis, Computers & Operations Research 34(10) (2007), 3143-3153.
36. R. Storn and K. Price, Differential evolution: A simple and efficient heuristic for global optimization over continuous spaces, Journal of Global Optimization 11(4) (1997), 341-359.
37. T. Stutzle, Applying iterated local search to the permutation flow-shop problem, Technical Report AIDA-98-04, Darm-stad University of Technology, Computer Science Department, Darmstad, 1998.
38. E. Taillard, Benchmarks for basic scheduling problems, European Journal of Operational Research 64(2) (1993), 278-285.
39. X. Xu, Z. Xu and X. Gu, An asynchronous genetic local search algorithm for the permutation flowshop scheduling problem with total flowtime minimization, Expert Systems with Applications 38(7) (2011), 7970-7979.