%0 Journal Article
%T A Branch-and-bound Algorithm for RCPSP with Each Activity Duration Dependent upon Its Actual Start-Time<br>任务工期随实际开工时间变化的RCPSP精确算法
%A MAO Ning
%A CHEN Qing
%A |xin
%A CHEN Xin
%A WANG Ying
%A |luo
%A <br>毛宁
%J 系统工程理论与实践
%D 2001
%I 
%X 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 problems with optimality.
%K resource\|constrained
%K project scheduling
%K nonpreemptive
%K branch\|and\|bound
%K variable resource requirement<br>资源受限
%K 项目调度
%K 不可中断
%K 分枝定界
%K 需求分布
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=01BA20E8BA813E1908F3698710BBFEFEE816345F465FEBA5&cid=962324E222C1AC1D&jid=1D057D9E7CAD6BEE9FA97306E08E48D3&aid=19F755A82965CB25&yid=14E7EF987E4155E6&vid=659D3B06EBF534A7&iid=CA4FD0336C81A37A&sid=4F2F18DD6F870C2C&eid=46CB27789995047D&journal_id=1000-6788&journal_name=系统工程理论与实践&referenced_num=0&reference_num=28