.png){kind=icon}
返回
Epsilon Oscillation Algorithm for the bi-objective green identical parallel machine scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2024.106754.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper addresses the bi-objective optimization problem of scheduling jobs on multiple identical parallel machines to minimize both makespan and total energy consumption. The problem can be denoted as Pm, TOU divided by divided by C max , TEC . A Pipe Variable Neighborhood Descent approach with Dynamic Programming, employing an Epsilon Constraint method and incorporating an Epsilon Oscillation technique that consists of alternating between ascending and descending ways to vary the epsilon value. This technique improves the pareto front by exploring new search space. A comparison is provided between the proposed Epsilon Oscillation Algorithm (EOA) and the state-of-the-art solving techniques. The experimental results as well as the statistical tests show the significant superiority of the EOA, motivating its adaptation to solve other bi-objective scheduling problems.
Keyword:
Scheduling
Green
Identical parallel machines
Bi-objective optimization
Epsilon oscillation
Variable neighborhood descent
Dynamic programming
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
PREAI
分享收藏Cost and carbon reductions from industrial demand-side management: Study of potential savings at a cement plant.png)
APPLIED ENERGY
OAAI
APPLIED ENERGYIF11
OAAI分享收藏分享收藏分享收藏
查看更多内容