THE COMPLEXITY OF A KIND OF SCHEDULING WITH Tk-PROCESSOR TASKS

Jiang Hou-yuan

Acta Mathematicae Applicatae Sinica ›› 1991, Vol. 14 ›› Issue (4) : 433-440.

PDF(524 KB)
中国科学院数学与系统科学研究院期刊网
PDF(524 KB)
Acta Mathematicae Applicatae Sinica ›› 1991, Vol. 14 ›› Issue (4) : 433-440. DOI: 10.12387/C1991059

THE COMPLEXITY OF A KIND OF SCHEDULING WITH Tk-PROCESSOR TASKS

  • {{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}}. Acta Mathematicae Applicatae Sinica, 1991, 14(4): 433-440 https://doi.org/10.12387/C1991059

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(524 KB)

Accesses

Citation

Detail
Sections
Recommended

/

〈 〉