Hybrid bat algorithm for flow shop scheduling problems
Summary: In this paper, a hybrid bat algorithm is proposed to solve the permutation flow shop scheduling problems with makespan criterion. Developed for numerical optimisation, local search techniques are integrated into the bat algorithm to solve the flow shop problems. Reeves test problems from the literature are used to compare the performance of the proposed algorithm against the best known solutions, NEH and with different metaheuristics. Computational results and statistical analysis indicate that the proposed algorithm can be more efficient than many other metaheuristic algorithms addressed in the literature.
- An improved bat algorithm for scheduling of no-wait flow shop problem
- Improved bat algorithm for job shop scheduling problem
- Using artificial bee colony algorithm for permutation flow shop scheduling problem under makespan criterion
- A hybrid particle swarm optimization algorithm for the permutation flowshop scheduling problem
- A hybrid harmony search algorithm for the no-wait flow-shop scheduling problems
- Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem
- An improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors -- a case study
- An improved bat algorithm for scheduling of no-wait flow shop problem
- Improved bat algorithm for job shop scheduling problem
- A discrete inter-species cuckoo search for flowshop scheduling problems
- Parameter less hybrid IG-Jaya approach for permutation flow shop scheduling problem
This page was built for publication: Hybrid bat algorithm for flow shop scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2204236)
