Ng Chi To. / Thesis (Ph.D.)--Chinese University of Hong Kong, 1996. / Includes bibliographical references (leaves 169-173). / Acknowledgements --- p.i / Abstract --- p.ii / Chapter Chapter 1 --- INTRODUCTION --- p.1 / Chapter 1.1 --- Problem Formulation and Motivation --- p.1 / Chapter 1.2 --- Past Research Works --- p.3 / Chapter 1.3 --- Results of the Study --- p.5 / Chapter 1.4 --- Organization of the Thesis --- p.7 / Chapter Part I --- THE CTV PROBLEM --- p.9 / Chapter Chapter 2 --- A GENERALIZATION OF SCHRAGE'S CONJEC- TURE --- p.10 / Chapter 2.1 --- Schrage's Conjecture --- p.10 / Chapter 2.2 --- Generalization --- p.13 / Chapter Chapter 3 --- ASYMPTOTIC OPTIMALITY --- p.15 / Chapter 3.1 --- Optimal Sequences under a Symmetric Structure --- p.17 / Chapter 3.2 --- An Upper Bound for the Relative Error --- p.21 / Chapter 3.3 --- Asymptotical Probabilistic Analysis --- p.25 / Chapter Chapter 4 --- ADDITIONAL FINDINGS --- p.37 / Chapter Chapter 5 --- THE BEST V-SHAPED SEQUENCE --- p.46 / Chapter 5.1 --- Transformation of the CTV Problem to a Boolean Optimization Problem --- p.47 / Chapter 5.2 --- Minimization of the Expected CTV among All the V-shaped Fixed Sequences --- p.48 / Chapter Chapter 6 --- THE WORST CASE ANALYSIS --- p.65 / Chapter 6.1 --- A Lower Bound for the CTV Problem --- p.66 / Chapter 6.2 --- A Worst Case Bound --- p.71 / Chapter Part II --- EXTENSIONS --- p.75 / Chapter Chapter 7 --- A MORE GENERAL MODEL --- p.76 / Chapter 7.1 --- Some Basic Concepts --- p.76 / Chapter 7.2 --- Problem Description --- p.78 / Chapter 7.3 --- Applications and Difficulties --- p.80 / Chapter Chapter 8 --- THE ZERO STARTING PROBLEM --- p.83 / Chapter 8.1 --- Problem Transformation --- p.85 / Chapter 8.2 --- Properties --- p.88 / Chapter 8.3 --- Algorithm A and Promising Solutions --- p.93 / Chapter 8.4 --- Time Complexity of Algorithm A --- p.94 / Chapter Chapter 9 --- PROBABILISTIC ANALYSIS OF PROMISING SO- LUTIONS --- p.95 / Chapter 9.1 --- Promising Solutions under a Symmetric Structure --- p.95 / Chapter 9.2 --- An Upper Bound for the Relative Error of Promising Solutions --- p.100 / Chapter 9.3 --- Probabilistic Analysis on the Relative Error of Promising Solutions --- p.106 / Chapter Chapter 10 --- CONCLUDING REMARKS AND FUTURE RESEARCH WORK --- p.118 / Appendix A Preliminary Results for Analysis --- p.122 / Appendix B Proofs of Some Lemmas --- p.127 / Appendix C Proofs of Some Theorems --- p.149 / Appendix D Proofs of Some Properties --- p.160 / Appendix E An Alternative to Completion Time Variance --- p.167 / Bibliography --- p.169
| Identifer | oai:union.ndltd.org:cuhk.edu.hk/oai:cuhk-dr:cuhk_321580 |
| Date | January 1996 |
| Contributors | Ng, Chi To., Chinese University of Hong Kong Graduate School. Division of Systems Engineering and Engineering Management. |
| Publisher | Chinese University of Hong Kong |
| Source Sets | The Chinese University of Hong Kong |
| Language | English |
| Detected Language | English |
| Type | Text, bibliography |
| Format | print, vi, 173 leaves ; 30 cm. |
| Rights | Use of this resource is governed by the terms and conditions of the Creative Commons “Attribution-NonCommercial-NoDerivatives 4.0 International” License (http://creativecommons.org/licenses/by-nc-nd/4.0/) |
Page generated in 0.0083 seconds