Art
J-GLOBAL ID：200902050139040545   Reference number：90A0751820

Minimizing total tardiness on one machine is NP-hard.

1機械の総遅れを最小とする問題はNPハードである
Author (2)：
DU J

About DU J

(Univ. Texas at Dallas)

About Univ. Texas at Dallas

, 
LEUNG J Y-T

About LEUNG J Y-T

(Univ. Texas at Dallas)

About Univ. Texas at Dallas


Material：
Mathematics of Operations Research  (Math Oper Res)

About Mathematics of Operations Research


Volume： 15  Issue： 3  Page： 483-495  Publication year： Aug. 1990 
JST Material Number： H0715A  ISSN： 0364-765X  Document type： Article
Article type： 原著論文  Country of issue： United States (USA)  Language： ENGLISH (EN)
Thesaurus term：
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.
scheduling

About scheduling

,...
   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=90A0751820&from=J-GLOBAL&jstjournalNo=H0715A") }}
JST classification (2)：
JST classification
Category name(code) classified by JST.
Network methods 
(KA03040X)

About Network methods

,  Theory of computation 
(JB02000A)

About Theory of computation

Terms in the title (2)：
Terms in the title
Keywords automatically extracted from the title.
総遅れ

About 総遅れ

, 
Np

About Np


Return to Previous Page

TOP

BOTTOM