A variable neighborhood MOEA/D for multiobjective test task scheduling problem
From MaRDI portal
Publication:1718350
DOI10.1155/2014/423621zbMath1407.90166OpenAlexW2036297960WikidataQ59067035 ScholiaQ59067035MaRDI QIDQ1718350
Lijuan Yin, Zheng Zhu, Hui Lu, Xiaoteng Wang
Publication date: 8 February 2019
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/423621
Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- MOEA/D + uniform design: a new version of MOEA/D for optimization problems with many objectives
- An improved genetic algorithm for the distributed and flexible job-shop scheduling problem
- Nonlinear multiobjective optimization
- A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times
- Modified bottleneck-based heuristic for large-scale job-shop scheduling problems with a single bottleneck
- Job shop scheduling problem based on DNA computing
- Comparison between MOEA/D and NSGA-II on the Multi-Objective Travelling Salesman Problem