A decomposition-based artificial bee colony algorithm for the multi-objective flexible jobshop scheduling problem
DOI10.1080/0305215X.2021.1884243zbMATH Open1523.90196OpenAlexW3133936234WikidataQ113279093 ScholiaQ113279093MaRDI QIDQ6094486FDOQ6094486
Authors: Pierre Borne, Moncef Tagina 
Publication date: 10 October 2023
Published in: Engineering Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0305215x.2021.1884243
Recommendations
- Hybrid particle-swarm optimization for the multi-objective flexible job-shop scheduling problem
- An improved artificial bee colony algorithm for fuzzy flexible job-shop scheduling problem
- A modified biogeography-based optimization for the flexible job shop scheduling problem
- An artificial bee colony algorithm for solving hybrid flow-shop scheduling problems with unrelated parallel machines
multi-objective optimizationartificial bee colony (ABC)decomposition-based approachmulti-objective flexible jobshop scheduling problem
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic
- Routing and scheduling in a flexible job shop by tabu search
- Solving the flexible job shop scheduling problem with sequence-dependent setup times
- Efficient algorithms for flexible job shop scheduling with parallel machines
Cited In (3)
This page was built for publication: A decomposition-based artificial bee colony algorithm for the multi-objective flexible jobshop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6094486)
