Worst-case Absolute Regret based Solution Algorithms for Optimization Problems with Interval Uncertainty

摘要：

Uncertain versions of three classical optimization problems are examined: the resource allocation in a complex of independent operations and two task scheduling problems 2||ZC,-, PCm,x.It is assumed that some parameters of the problems are uncertain and they belong to intervals of the known bounds.The complexity of the uncertain problems is determined.The worst-case absolute regret approach is used to evaluate the quality of the solutions.The exact, approximate or heuristic solution algorithms are proposed depending on the complexity and properties of the problems.

关键词： resource allocation task scheduling uncertainty minmax regret Scatter Search

作者: Jerzy Jozefczyk Marcin Siepak

作者单位: Institute of Informatics Wroclaw University of Technology Wroclaw,Poland

会议类型: 国际会议

会议名称: 2011 IEEE International Conference on Grey System and Intelligent Services Joint with the 15th WOSC International Congress on Cybernetics and System(2011 IEEE灰色系统与智能服务国际会议暨系统与控制世界组织第15届年会)

会议地点: 南京

会议语种:英文

页码: 889-895

在线出版日期: 2011-09-15（万方平台首次上网日期，不代表论文的发表时间）