.png){kind=icon}
返回
Approximating multi-objective scheduling problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2012.12.001.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In many practical situations, decisions are multi-objective by nature. In this paper, we propose a generic approach to deal with multi-objective scheduling problems (MOSPs). The aim is to determine the set of Pareto solutions that represent the interactions between the different objectives. Due to the complexity of MOSPs, an efficient approximation based on dynamic programming is developed. The approximation has a provable worst case performance guarantee. Even though the approximate Pareto set consists of fewer solutions, it represents a good coverage of the true set of Pareto solutions. We consider generic cost parameters that depend on the state of the system. Numerical results are presented for the time-dependent multi-objective knapsack problem, showing the value of the approximation in the special case when the state of the system is expressed in terms of time. (C) 2012 Elsevier Ltd. All rights reserved.
Keyword:
Multi-objective decisions
State-dependent costs
Approximation
Dynamic programming
c-Dominance
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
分享收藏Parallel partitioning method (PPM): A new exact method to solve bi-objective problems并行分区方法 (PPM): 解决双目标问题的新精确方法
OAAI
OAAI分享收藏
查看更多内容