A variable neighborhood MOEA/D for multiobjective test task scheduling problem
From MaRDI portal
Recommendations
- Chaotic multiobjective evolutionary algorithm based on decomposition for test task scheduling problem
- Solving the task assignment problem with a variable neighborhood search
- VNS for scheduling independent tasks to identical processors
- A variable neighbourhood search algorithm for the constrained task allocation problem
- A variable neighbourhood search algorithm for the flexible job-shop scheduling problem
Cites work
- scientific article; zbMATH DE number 3680816 (Why is no real title available?)
- scientific article; zbMATH DE number 3637904 (Why is no real title available?)
- A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times
- An improved genetic algorithm for the distributed and flexible job-shop scheduling problem
- Comparison between MOEA/D and NSGA-II on the Multi-Objective Travelling Salesman Problem
- Job shop scheduling problem based on DNA computing
- MOEA/D + uniform design: a new version of MOEA/D for optimization problems with many objectives
- Modified bottleneck-based heuristic for large-scale job-shop scheduling problems with a single bottleneck
- Nonlinear multiobjective optimization
Cited in
(2)
This page was built for publication: A variable neighborhood MOEA/D for multiobjective test task scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1718350)