Double layer ACO algorithm for the multi-objective FJSSP
From MaRDI portal
Publication:732169
DOI10.1007/s00354-008-0048-6zbMath1175.90201MaRDI QIDQ732169
Li-Ning Xing, Ying-Wu Chen, Ke-Wei Yang
Publication date: 9 October 2009
Published in: New Generation Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00354-008-0048-6
multi-objective optimization; combinatorial optimization; ant colony optimization; flexible job shop scheduling; scheduling knowledge
90C29: Multi-objective and goal programming
90B35: Deterministic scheduling theory in operations research
90C27: Combinatorial optimization
Related Items
Cites Work
- Unnamed Item
- Quantifiers in the formulation of multiple objective decision functions
- An effective architecture for learning and evolving flexible job-shop schedules
- Ant colony optimization combined with taboo search for the job shop scheduling problem
- Job-shop scheduling with multi-purpose machines
- Tabu search for the job-shop scheduling problem with multi-purpose machines
- An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
- An alternative framework to Lagrangian relaxation approach for job shop scheduling.
- A structural design of decision support systems for deteriorating repairable systems.
- An efficient genetic algorithm for job shop scheduling with tardiness objectives.
- Some new results on simulated annealing applied to the job shop scheduling problem
- Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic
- A tabu search method guided by shifting bottleneck for the job shop scheduling problem
- Effective neighbourhood functions for the flexible job shop problem
- Routing and scheduling in a flexible job shop by tabu search
- A hybrid genetic algorithm for the job shop scheduling problem
- Approximation schemes for job shop scheduling problems with controllable processing times
