ONE-MACHINE SEQUENCING PROBLEM FOR MINIMIZING TOTAL TARDINESS

Lin Yi-xun

Acta Mathematicae Applicatae Sinica ›› 1983, Vol. 6 ›› Issue (2) : 228-235.

PDF(2622 KB)
PDF(2622 KB)
Acta Mathematicae Applicatae Sinica ›› 1983, Vol. 6 ›› Issue (2) : 228-235. DOI: 10.12387/C1983029

ONE-MACHINE SEQUENCING PROBLEM FOR MINIMIZING TOTAL TARDINESS

  • {{article.zuoZhe_EN}}
Author information +
History +

HeighLight

{{article.keyPoints_en}}

Abstract

{{article.zhaiyao_en}}

Key words

QR code of this article

Cite this article

Download Citations
{{article.zuoZheEn_L}}. {{article.title_en}}. Acta Mathematicae Applicatae Sinica, 1983, 6(2): 228-235 https://doi.org/10.12387/C1983029

References

References

{{article.reference}}

Funding

RIGHTS & PERMISSIONS

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

Accesses

Citation

Detail

Sections
Recommended

/