任务工期随实际开工时间变化的RCPSP精确算法

毛宁;陈庆新;陈新;汪应洛

系统工程理论与实践 ›› 2001, Vol. 21 ›› Issue (1) : 71-78.

PDF(203 KB)
PDF(203 KB)
系统工程理论与实践 ›› 2001, Vol. 21 ›› Issue (1) : 71-78. DOI: 10.12011/1000-6788(2001)1-71
论文

任务工期随实际开工时间变化的RCPSP精确算法

    毛宁(1),陈庆新(1), 陈新(1),汪应洛(2)
作者信息 +

A Branch-and-bound Algorithm for RCPSP with Each Activity Duration Dependent upon Its Actual Start-Time

    Ning MAO(1),Qing Xin CHEN(1),Xin CHEN(1),Ying Luo WANG(2)
Author information +
文章历史 +

摘要

针对资源受限项目调度展开讨论 .与前人研究的侧重点有所不同 ,我们考虑了项目中每个任务工期随其实际开工时间而变化、任务对可更新 (再生 )资源需求的任意分布、以及可更新 (再生 )资源的最大供给量随着时间而变化的一般情形 .作为对前人研究结果的进一步推广 ,我们利用分枝定界技术 ,以及事件驱动的时间增量方式 ,成功地获得了这种一般的项目调度问题的最优解 .

Abstract

This paper deals with the multiple resource-constrained project scheduling problem (RCPSP). Differently from the problem investigated by other researchers, the problem handled in this paper is with variable resource requirement and variable renewable resource availability constraints. Besides, the duration of each activity in the project is dependent upon its actual start-time. As an extension, the branch and bound algorithm put forward in this paper can solve this kind of general project scheduling pro...

关键词

资源受限 / 项目调度 / 不可中断 / 分枝定界 / 需求分布

Key words

resource\|constrained / project scheduling / nonpreemptive / branch |and bound / variable resource requirement

引用本文

导出引用
毛宁 , 陈庆新 , 陈新 , 汪应洛. 任务工期随实际开工时间变化的RCPSP精确算法. 系统工程理论与实践, 2001, 21(1): 71-78 https://doi.org/10.12011/1000-6788(2001)1-71
Ning MAO , Qing Xin CHEN , Xin CHEN , Ying Luo WANG. A Branch-and-bound Algorithm for RCPSP with Each Activity Duration Dependent upon Its Actual Start-Time. Systems Engineering - Theory & Practice, 2001, 21(1): 71-78 https://doi.org/10.12011/1000-6788(2001)1-71
PDF(203 KB)

475

Accesses

0

Citation

Detail

段落导航
相关文章

/