(3.239.192.241) 您好!臺灣時間:2021/03/02 19:39
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果

詳目顯示:::

我願授權國圖
: 
twitterline
研究生:林妙聰
論文名稱:資源重置問題之研究
論文名稱(外文):A study of some resource relocation problems
指導教授:曾憲雄曾憲雄引用關係
指導教授(外文):Shian-Shyong Tseng
學位類別:博士
校院名稱:國立交通大學
系所名稱:資訊工程研究所
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:1991
畢業學年度:79
語文別:英文
論文頁數:143
相關次數:
  • 被引用被引用:0
  • 點閱點閱:121
  • 評分評分:系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
封面
ABSTRACT(in Chinese)
ABSTRACT(in English)
ACKNOWLEDGEMENT
TABLE OF CONTENTS
LIST OF FIGURES
LIST OF TABLES
1.INTRODUCTION
1.1Why Resource Relocation Problems
1.1.1 Informal Specifcations
1.1.2 Related Applications
1.2 Overview of Main Results
2. PROBLEM FORMULATION AND SURVEY OF RELATED WORK
2.1 Preliminaries and Formal Model
2.1.1 General Statements
2.1.2 Minimum Resource Requirements
2.2 Conventional Resource-Constrained Scheduling Problems
2.3 Kaplan and Amir's Algorithm
2.3.1 Algorithm K-A
2.3.2 Correctness and Time Complexity
2.4 Relocation Problems with Multiple Machines
2.4.1 Classified Cases
2.4.2 Open Problem
3.GENERATING THE BEST K SEQUENCES
3.1 Preliminaries
3.1.1 Interchange Arguments
3.1.2 Compund Jobs
3.2 Basic Properties
3.3 The Generating Algorithm
3.3.1 Alogrithm BESTK
3.3.2 Analysis of Algorithm BEST_K
3.4 Conclusions
4 RELOCATION PROBLEMS WITH PRECEDENCE CONSTRAINTS
4.1 General Statements
4.1.1 Problem Study
4.1.2 NP-Hardness
4.2 Three Fundamental Cases
4.2.1 Algorithm P_DAG
4.2.2 Algorithm N_DAG
4.2.3 Algorithm P_N_DAG
4.3 Alogorithm for Inforests
4.3.1 Basic Properties
4.3.2 Algorithm PRE_INFOREST
4.3.3 Correctness and Time Complesity
4.4 Algorithm for Outforests
4.4.1 Basic Properties
4.4.2 Algorithm PRE_OUTFOREST
4.4.3 Correctness and Time Complexity
4.5 Conclusions
5 RELOCATION PROBLEMS WITH PROCESSING TIME AND DEADLINES
5.1 Introduction
5.2 NP-hardness
5.3 Algorithm FIXED_REQ
5.4 Algorithm TWO_DEADLINES
5.4.1 Alforithm TOW_DEADLINES
5.4.2 Correctness and Time Comlpexity
5.5 Conclusions
6 MINIMIZATION PROBLEMS UNDER A COMMONDUE-DATE
6.1 Introduction
6.1.1 Common Due-Date
6.1.2 Problem Formulation
6.2 NP-hardness and Polynomial Solvability
6.3 Branch-and -Bound Algorithm for RPNC
6.3.1 Dominance Concept
6.3.2 The Dominance Algorithm
6.3.3 Experimental Results
6.4 Conclussions
7. CONCLUDING REMARKS AND FURTHER STUDIES
7.1 Conclusions
7.2 Further Studies
7.2.1 RP with Two Machines
7.2.2 RP with Processing Times and Deadlines
7.2.3 RP with Processing Time and Release Time
7.2.4 RP of Minimizing Total Completion Time
Appendix: RP WITH HETEROGENEOUS RESOURCES
A.1 Problem Formulation
A.2 NP-hardness
A.3 Branch-and-Bound Algorithm
BIBLIOGRAPHY
VITA
INDES
參考書目: 葉133-139
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
無相關論文
 
系統版面圖檔 系統版面圖檔