Discrete Fireworks Algorithm for Single Machine Scheduling Problems

Abstract

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.

A modified elephant herd optimization algorithm to solve the single machine scheduling problems

“…Wang and Tang [38] of local search neighbourhoods for solving the SMTWTSP was presented by Geiger [39]. El Majdouli and El Imrani [40] introduced a Discrete Fireworks algorithm (DFA) for solving the SMTWTSP. The proposed DFA is hybridized with VNS heuristic.…”

Multiobjective flexible job-shop scheduling optimization for manufacturing servitization

“…, 2017), which always attracts scholars to do research. According to the characteristics of different kinds of machines, scheduling problems can be divided into single-machine scheduling problem (Majdouli and Imrani, 2016), parallel-machine scheduling problem (Mohammed et al. , 2021), flow shop scheduling problem (Neufeld et al.…”

“…However, the production scheduling problem belongs to NP-hard problems (Shim et al, 2017), which always attracts scholars to do research. According to the characteristics of different kinds of machines, scheduling problems can be divided into single-machine scheduling problem (Majdouli and Imrani, 2016), parallel-machine scheduling problem (Mohammed et al, 2021), flow shop scheduling problem (Neufeld et al, 2021) and flexible job-shop scheduling problem (FJSP) (Seyed and Dalila, 2021). FJSP problem as an extension of the traditional job-shop scheduling problem (JSP), has the characteristics of flexible operation and complex models.…”