返回
A priority-rule method for project scheduling with work-content constraints
DOI:10.1016/j.ejor.2009.09.019.png)
摘要
En 中文
The activities of a project are in general characterized by a work content in terms of resource-time units, e.g. person-days. Even though most project scheduling models assume a time-invariant resource usage, normally it is possible to vary the resource usage during the execution of an activity. Typically, a lower and an upper bound on this resource usage and a minimum time lag between consecutive changes of this resource usage are prescribed. The project scheduling problem studied in this paper consists in determining a feasible resource-usage profile for each activity such that the project duration is minimized subject to precedence and resource-capacity constraints. While the known solution methods interpret the prescribed work content as a lower bound, we assume that each activity's work content must be processed exactly. We propose a priority-rule scheduling method that iteratively determines a feasible resource-usage profile for each activity. We present a consistency test for constructing such profiles more efficiently. Our computational results demonstrate that the new method solves more instances to feasibility than two benchmark procedures, and is suited for project instances with up to 200 activities. (C) 2009 Elsevier B.V. All rights reserved.
Keyword:
Project scheduling
Variable resource usage
Work content
Priority-rule method
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation重新审视串行和并行资源受限的项目调度方法: 理论和计算
A hybrid genetic algorithm for the resource-constrained project scheduling problem一种求解资源受限项目调度问题的混合遗传算法
Activity list representation for a generalization of the resource-constrained project scheduling problem资源受限项目调度问题泛化的活动列表表示

