.png){kind=icon}
返回
Multiprocessor Scheduling Based on Evolutionary Technique for Solving Permutation Flow Shop Problem
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.2973575.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Multiprocessor scheduling is one of the thrust areas in the field of computational science. There are various traditional scheduling techniques exist for the allocation and processing of jobs. But the performance of these techniques reduce in terms of makespan and waiting time when a large number of jobs are allocated to multiprocessors. In this paper, a new stochastic evolutionary technique is proposed based on the Genetic Algorithm and Pareto optimality. The new technique is implemented in a high-performance computing (HPC) environment using a Message passing interface (MPI) to resolve the permutation flow shop scheduling problem. Pareto optimality technique is used for sample distribution and the basis of the decision to select the lower bound of the makespan, instead of selecting the makespan directly for the best solution. The performance and quality evaluation of proposed techniques (GA & x005F;PO & x005F;MPI, GA) are compared with traditional techniques (FCFS, FCFS & x005F;MPI, TSAB, TSGP, TSGW) on the basis of Relative Percentage Deviation (RPD), Computational Time (CT) and Average Waiting Time and found satisfactory.
Keyword:
Processor scheduling
Program processors
Optimal scheduling
Job shop scheduling
Task analysis
Genetic algorithms
Average relative percentage deviation (RPD)
computational time (CT)
flowshop
GA_PO_MPI
HPC
MPI
pareto optimal
scheduling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
.png){kind=icon}
An Ant Colony Optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
PREAI
分享收藏分享收藏
查看更多内容