Project scheduling under resource constraints: Application of the cumulative global constraint
Project scheduling under resource constraints: Application of the cumulative global constraint
复制标题
资源约束下的项目调度：累积全局约束的应用
DOI：
10.1016/j.cie.2010.08.014
复制
发表时间：
2009
期刊：
影响因子：
--
通讯作者：
Pierre Lopez
中科院分区：
文献类型：
--
作者：
Mariem Trojet;F. H'Mida;Pierre Lopez
本文研究了资源约束下的项目调度问题。传统上，目标是在尊重优先约束和资源约束的情况下，找到使项目完工时间最短的唯一解。本文的工作重点是开发一个用于工业应用的累积全局约束的模型和决策支持框架。对于给定的项目调度，所提出的方法允许生成相对于外包和资源的交替可获得性的不同的最优解。其目的是为决策者提供辅助，以便在考虑可能的能力资源的情况下构建、选择和定义适当的调度方案。考虑的工业问题被建模为约束满足问题(CSP)。它是在约束编程语言芯片V5下实现的。所提供的解决方案确定与在每个资源上实现的任务相关联的各种变量的值，以及具有资源按时总消耗量的曲线。
This paper concerns project scheduling under resource constraints. Traditionally, the objective is to find a unique solution that minimizes the project makespan, while respecting the precedence constraints and the resource constraints. This work focuses on developing a model and a decision support framework for industrial application of the cumulative global constraint. For a given project scheduling, the proposed approach allows the generation of different optimal solutions relative to the alternate availability of outsourcing and resources. The objective is to provide a decision-maker an assistance to construct, choose, and define the appropriate scheduling program taking into account the possible capacity resources. The industrial problem under consideration is modeled as a constraint satisfaction problem (CSP). It is implemented under the constraint programming language CHIP V5. The provided solutions determine values for the various variables associated to the tasks realized on each resource, as well as the curves with the profile of the total consumption of resources on time.