An Optimal Algorithm for Solving Job-Shop Scheduling to Minimize Total Holding Cost of Completed and Processing Products Subject to Non-Tardy Jobs
納期厳守型ジョブショップスケジューリングにおける製品と仕掛り品の総在庫コスト最小化問題の最適解法
Publisher site
{{ this.onShowPLink() }}
Copy service
{{ this.onShowCLink("http://jdream3.com/copy/?sid=JGLOBAL&noSystem=1&documentNoArray=03A0449314©=1") }}
Volume:
54
Issue:
2
Page:
95-103
Publication year:
Jun. 15, 2003
JST Material Number:
F0241B
ISSN:
1342-2618
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.
To see more with JDream III (charged).
{{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=03A0449314&from=J-GLOBAL&jstjournalNo=F0241B") }}
JST classification (1):
JST classification
Category name(code) classified by JST.
2) MUTH J. F. Industrial Scheduling. Prentice-Hall, Englewood Cliffs. (1963)
3) LAWRENCE S. Resource Constrained Project Scheduling : An Experimental Investigation of Heuristic Scheduling Techniques. Carnegie Mellon University. (1963)