Discrete Fireworks Algorithm for Single Machine Scheduling Problems

Over the recent years, Fireworks Algorithm has recorded an increasing success on solving continuous optimization problems, due to its efficiency, simplicity and more importantly its rapid convergence to good optimums. Thus, the Fireworks Algorithm performance is now widely comparable with the most popular methods in the optimization field such as evolutionary computation and swarm intelligence techniques. This paper introduces a discrete Fireworks Algorithm for combinatorial single machine scheduling problems. Taking advantage of the robust design of the original Fireworks Algorithm, a new adaptation of sparks generation is proposed with a novel use of the control parameters. To verify the explorative performance of the algorithm, a hybridization with Variable Neighborhood Search heuristic is implemented. To validate it, the proposed method is tested with several benchmarks instances of the single machine total weighted tardiness. A comparison with other optimization algorithms is also included. The obtained results exhibit the high performance of the proposed method.

[1]  Ke Ding,et al.  Introduction to Fireworks Algorithm , 2013, Int. J. Swarm Intell. Res..

[2]  A.C. Nearchou.  Solving the single machine total weighted tardiness scheduling problem using a hybrid simulated annealing algorithm , 2004, 2nd IEEE International Conference on Industrial Informatics, 2004. INDIN '04. 2004.

[3]  Ku Ruhana Ku-Mahamud,et al.  Interacted multiple ant colonies optimization approach for the single machine total weighted tardiness problem , 2011 .

[4]  Pierre Hansen,et al.  Variable neighborhood search , 1997, Eur. J. Oper. Res..

[5]  Lamia Benameur,et al.  A hybrid discrete particle swarm algorithm for solving the fixed-spectrum frequency assignment problem , 2010, Int. J. Comput. Sci. Eng..

[6]  Qi Feng,et al.  Two-agent single machine scheduling with forbidden intervals , 2015 .

[7]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[8]  Michael N. Vrahatis,et al.  Studying the Performance of Unified Particle Swarm Optimization on the Single Machine Total Weighted Tardiness Problem , 2006, Australian Conference on Artificial Intelligence.

[9]  S. G. Ponnambalam,et al.  An investigation on single machine total weighted tardiness scheduling problems , 2003 .

[10]  Vitaly A. Strusevich,et al.  Single machine scheduling with time-dependent linear deterioration and rate-modifying maintenance , 2015, J. Oper. Res. Soc..

[11]  Laurent Péridy,et al.  A Branch and Bound Algorithm to Minimize Total Weighted Tardiness on a Single Processor , 2004, Ann. Oper. Res..

[12]  Kayvan Asghari,et al.  Solving Single Machine Total Weighted Tardiness Problem using Variable Structure Learning Automata , 2012 .

[13]  Wenbo Liu,et al.  On the population diversity control of evolutionary algorithms for production scheduling problems , 2012, 2012 IEEE Fifth International Conference on Advanced Computational Intelligence (ICACI).

[14]  Manuel M. Crisóstomo,et al.  Single Machine Total Weighted Tardiness Problem with Genetic Algorithms , 2007, 2007 IEEE/ACS International Conference on Computer Systems and Applications.

[15]  Mehmet Fatih Tasgetiren,et al.  Particle swarm optimization algorithm for single machine total weighted tardiness problem , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).