arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1310.0602cs.AI
收藏

资源受限多模式多项目调度问题的迭代变邻域搜索算法

Iterated Variable Neighborhood Search for the resource constrained multi-mode multi-project scheduling problem

Helmut-Schmidt-University, University of the Federal Armed Forces Hamburg(赫尔穆特·施密特大学(汉堡联邦国防军大学))

Martin Josef Geiger

摘要:

资源受限多模式多项目调度问题是一个非常困难的组合优化问题。对于一组给定的活动,必须找到可行的执行模式分配和执行开始时间,以便优化某些优化函数,例如最大完工时间。当确定决策变量值的最优(或至少可行的)分配时,一组侧约束,诸如资源可用性、优先约束等,必须得到尊重2013年,MISTA 2013挑战赛规定了RCMMMPSP中的研究。它的目标是在运行时间限制下解决给定的一组实例。我们通过这里提出的方法为应对这一挑战做出了贡献。

英文摘要:

The resource constrained multi-mode multi-project scheduling problem (RCMMMPSP) is a notoriously difficult combinatorial optimization problem. For a given set of activities, feasible execution mode assignments and execution starting times must be found such that some optimization function, e.g. the makespan, is optimized. When determining an optimal (or at least feasible) assignment of decision variable values, a set of side constraints, such as resource availabilities, precedence constraints, etc., has to be respected. In 2013, the MISTA 2013 Challenge stipulated research in the RCMMMPSP. It's goal was the solution of a given set of instances under running time restrictions. We have contributed to this challenge with the here presented approach.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑