A variable neighborhood MOEA/D for multiobjective test task scheduling problem

DOI10.1155/2014/423621MaRDI QIDQ1718350zbMATH OpenOpenAlexWikidataFDO

Authors Hui Lu, Zheng Zhu, Xiaoteng Wang, Lijuan Yin

Publication date 8 February 2019

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.1155/2014/423621

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Review text

Summary: Test task scheduling problem (TTSP) is a typical combinational optimization scheduling problem. This paper proposes a variable neighborhood MOEA/D (VNM) to solve the multiobjective TTSP. Two minimization objectives, the maximal completion time (makespan) and the mean workload, are considered together. In order to make solutions obtained more close to the real Pareto Front, variable neighborhood strategy is adopted. Variable neighborhood approach is proposed to render the crossover span reasonable. Additionally, because the search space of the TTSP is so large that many duplicate solutions and local optima will exist, the Starting Mutation is applied to prevent solutions from becoming trapped in local optima. It is proved that the solutions got by VNM can converge to the global optimum by using Markov Chain and Transition Matrix, respectively. The experiments of comparisons of VNM, MOEA/D, and CNSGA (chaotic nondominated sorting genetic algorithm) indicate that VNM performs better than the MOEA/ D and the CNSGA in solving the TTSP. The results demonstrate that proposed algorithm VNM is an efficient approach to solve the multiobjective TTSP.

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

• 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
• scientific article; zbMATH DE number 3680816 (Why is no real title available?)
• scientific article; zbMATH DE number 3637904 (Why is no real title available?)
• Job shop scheduling problem based on DNA computing
• Modified bottleneck-based heuristic for large-scale job-shop scheduling problems with a single bottleneck
• MOEA/D + uniform design: a new version of MOEA/D for optimization problems with many objectives
• Nonlinear multiobjective optimization

Cited in

(2)

• Chaotic multiobjective evolutionary algorithm based on decomposition for test task scheduling problem
• Local search approaches for the test laboratory scheduling problem with variable task grouping

Describes a project that uses

Uses Software

• MOEA/D

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)