THE NP-HARDNESS OF THE SINGLE MACHINE COMMON DUE DATE WEIGHTED TARDINESS PROBLEM

YUAN Jinjiang

系统科学与复杂性(英文) ›› 1992, Vol. 5 ›› Issue (4) : 328-333.

PDF(267 KB)
中国科学院数学与系统科学研究院期刊网
JSSC
PDF(267 KB)
系统科学与复杂性(英文) ›› 1992, Vol. 5 ›› Issue (4) : 328-333.
论文

THE NP-HARDNESS OF THE SINGLE MACHINE COMMON DUE DATE WEIGHTED TARDINESS PROBLEM

    YUAN Jinjiang
作者信息 +

THE NP-HARDNESS OF THE SINGLE MACHINE COMMON DUE DATE WEIGHTED TARDINESS PROBLEM

    YUAN Jinjiang
Author information +
文章历史 +

摘要

In this paper we prove that the single machine common due date weighted tardiness problem is NP-hard.

Abstract

In this paper we prove that the single machine common due date weighted tardiness problem is NP-hard.

关键词

Due date / tardinessm / NP-complete

Key words

Due date / tardiness / NP-complete

引用本文

EndNote

Ris (Procite)

Bibtex

导出引用
YUAN Jinjiang. THE NP-HARDNESS OF THE SINGLE MACHINE COMMON DUE DATE WEIGHTED TARDINESS PROBLEM. 系统科学与复杂性(英文), 1992, 5(4): 328-333
YUAN Jinjiang. THE NP-HARDNESS OF THE SINGLE MACHINE COMMON DUE DATE WEIGHTED TARDINESS PROBLEM. Journal of Systems Science and Complexity, 1992, 5(4): 328-333
PDF(267 KB)

254

Accesses

0

Citation

Detail
段落导航
相关文章

/

〈 〉