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

Ning MAO;Qing Xin CHEN;Xin CHEN;Ying Luo WANG

Systems Engineering - Theory & Practice ›› 2001, Vol. 21 ›› Issue (1) : 71-78.

PDF(203 KB)
中国科学院数学与系统科学研究院期刊网
PDF(203 KB)
Systems Engineering - Theory & Practice ›› 2001, Vol. 21 ›› Issue (1) : 71-78. DOI: 10.12011/1000-6788(2001)1-71
论文

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

    {{javascript:window.custom_author_en_index=0;}}
  • {{article.zuoZhe_EN}}
Author information +
History +

HeighLight

{{article.keyPoints_en}}

Abstract

{{article.zhaiyao_en}}

Key words

QR code of this article

Cite this article

EndNote

Ris (Procite)

Bibtex

Download Citations
{{article.zuoZheEn_L}}. {{article.title_en}}. Systems Engineering - Theory & Practice, 2001, 21(1): 71-78 https://doi.org/10.12011/1000-6788(2001)1-71

References

Publishing order | Descend order by publishing year | Descend order by cited within

References

{{article.reference}}

Funding

RIGHTS & PERMISSIONS

{{article.copyrightStatement_en}}
{{article.copyrightLicense_en}}
PDF(203 KB)

Accesses

Citation

Detail
Sections
Recommended

/

〈 〉