The Discrete Swallow Swarm Optimization for Flow-Shop Scheduling Problem
- 507 Downloads
The flow-shop scheduling problem is a well-known problem in production system. The objective is minimizing the total time it takes to process the entire job called makespan. In order to solve this NP-hard problem, we approve a new adaptation approach based on the intelligent behaviors of swallows, it is the discrete swallow swarm optimization algorithm (DSSO) present a recent metaheuristic method used to solve a combinatorial problem. The proposed algorithm is tested on different benchmarks instances and compared with different proposed algorithms. The results demonstrate that the proposed algorithm is more efficient than the other compared algorithms. It can be used to solve large instances of flow shop scheduling problem effectively.
KeywordsSwallow swarm optimization algorithm Combinatorial problem Metaheuristic Flow-shop scheduling problem Makespan
- 4.Bouzidi, M., Riffi, M.E., Serhir, A.: Discrete particle swarm optimization for travelling salesman problems: new combinatorial operators. In: Proceedings of the Ninth International Conference on Soft Computing and Pattern Recognition (SoCPaR 2017), pp. 141–150. Springer, Cham (2017)Google Scholar
- 5.Bouzidi, S., Riffi, M.E.: Discrete swallow swarm optimization algorithm for travelling salesman problem. In: Proceedings of the 2017 International Conference on Smart Digital Environment, pp. 80–84. ACM, New York, NY, USA (2017)Google Scholar
- 15.Sayoti, F.: Golden Ball Algorithm for solving Flow Shop Scheduling Problem. Int. J. Interact. Multimedia Artif. Intell. 4, 15–18 (2016)Google Scholar