Art
J-GLOBAL ID:200902056644842077   Reference number:86A0209429

An optimizing algorithm for project scheduling problem. Using the solution method of extended packing problem.

プロジェクト・スケジューリング問題の一最適解法 拡張型集合詰込問題の解法利用による
Author (1):
Material:
Volume: 37  Issue:Page: 44-50  Publication year: Apr. 1986 
JST Material Number: F0241B  ISSN: 0386-4812  Document type: Article
Article type: 原著論文  Country of issue: Japan (JPN)  Language: JAPANESE (JA)
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.
,...
Semi 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.

   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=86A0209429&from=J-GLOBAL&jstjournalNo=F0241B") }}
JST classification (1):
JST classification
Category name(code) classified by JST.
Mathematical programmings 

Return to Previous Page