Hybrid bat algorithm for flow shop scheduling problems

DOI10.1504/IJMOR.2016.077560MaRDI QIDQ2204236zbMATH OpenOpenAlexFDO

Authors Ömür Tosun, M. K. Marichelvam

Publication date 15 October 2020

Published in International Journal of Mathematics in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/ijmor.2016.077560

zbMATH Keywords

bat algorithmflowshop schedulinglocal searchmakespanmetaheuristics

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• 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

Cited in

(6)

• 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)