Thesis (Ph. D.)--Carleton University, 2002. / Includes bibliographical references (p. 342-353). Also available in electronic format on the Internet.

Thesis (Ph. D.)--University of Texas at Austin, 2002. / Vita. Includes bibliographical references. Available also from UMI Company.

Kwan, Cheuk Lam. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2009. / Includes bibliographical references (p. 115-118). / Abstract also in Chinese. / Chapter 1 --- Introduction --- p.9 / Chapter 1.1 --- The Gate Assignment Problem --- p.9 / Chapter 1.2 --- Contributions --- p.10 / Chapter 1.3 --- Formulation of Gate Assignment Problem --- p.11 / Chapter 1.4 --- Organization of Thesis --- p.13 / Chapter 2 --- Literature Review --- p.15 / Chapter 2.1 --- Introduction --- p.15 / Chapter 2.2 --- Formulations of Gate Assignment Problems --- p.15 / Chapter 2.2.1 --- Static Gate Assignment Model --- p.16 / Chapter 2.2.1.1 --- Total Passenger Walking Distance --- p.17 / Chapter 2.2.1.2 --- Waiting Time --- p.20 / Chapter 2.2.1.3 --- Unassigned Flights --- p.21 / Chapter 2.2.2 --- Stochastic and Robust Gate Assignment Model --- p.22 / Chapter 2.2.2.1 --- Idle Time --- p.22 / Chapter 2.2.2.2 --- Buffer Time --- p.23 / Chapter 2.2.2.3 --- Flight Delays --- p.23 / Chapter 2.2.2.4 --- Gate Conflicts --- p.24 / Chapter 2.3 --- Solution Methodologies --- p.25 / Chapter 2.3.1 --- Expert System Approaches --- p.25 / Chapter 2.3.2 --- Optimization --- p.27 / Chapter 2.3.2.1 --- Exact Methods --- p.27 / Chapter 2.3.2.2 --- Heuristic Approaches --- p.28 / Chapter 2.3.2.3 --- Meta-Heuristics Approaches --- p.29 / Chapter 2.3.2.4 --- Tabu Search and Path Relinking --- p.31 / Chapter 2.4 --- Current Practice of Gate Assignment Problems --- p.32 / Chapter 2.5 --- Summary --- p.32 / Chapter 3 --- Tabu Search --- p.34 / Chapter 3.1 --- Introduction --- p.34 / Chapter 3.2 --- Mathematical Model --- p.34 / Chapter 3.3 --- Principles of Tabu Search --- p.36 / Chapter 3.4 --- Neighborhood Structures --- p.38 / Chapter 3.4.1 --- Insert Move --- p.38 / Chapter 3.4.2 --- Exchange Move --- p.39 / Chapter 3.5 --- Short Term Memory Structure --- p.41 / Chapter 3.6 --- Aspiration Criterion --- p.42 / Chapter 3.7 --- Intensification and Diversification Strategies --- p.43 / Chapter 3.8 --- Tabu Search Framework --- p.45 / Chapter 3.8.1 --- Initial Solution --- p.45 / Chapter 3.8.2 --- Tabu Search Algorithm --- p.46 / Chapter 3.9 --- Computational Studies --- p.52 / Chapter 3.9.1 --- Parameters Tuning --- p.52 / Chapter 3.9.1.1 --- Fine-tuning a Tabu Search Algorithm with Statistical Tests --- p.53 / Chapter 3.9.1.2 --- Tabu Tenure --- p.54 / Chapter 3.9.1.3 --- Move Selection Strategies --- p.56 / Chapter 3.9.1.4 --- Frequency of Exchange Moves --- p.59 / Chapter 3.9.2 --- Comparison the Fine-tuned TS with original TS --- p.62 / Chapter 3.10 --- Conclusions --- p.63 / Chapter 4 --- Path Relinking --- p.65 / Chapter 4.1 --- Introduction --- p.65 / Chapter 4.2 --- Principles of Path Relinking --- p.65 / Chapter 4.2.1 --- Example of Path Relinking --- p.66 / Chapter 4.3 --- Reference Set --- p.68 / Chapter 4.3.1 --- Two-Reference-Set Implementation --- p.71 / Chapter 4.3.1.1 --- Random Exchange Gate Move --- p.72 / Chapter 4.4 --- Initial and Guiding Solution --- p.73 / Chapter 4.5 --- Path-Building Process --- p.74 / Chapter 4.6 --- Tabu Search Framework with Path Relinking --- p.78 / Chapter 4.6.1 --- Computational Complexities --- p.82 / Chapter 4.7 --- Computational Studies --- p.82 / Chapter 4.7.1 --- Best Configuration for Path Relinking --- p.83 / Chapter 4.7.1.1 --- Reference Set Strategies and Initial and Guiding Criteria --- p.83 / Chapter 4.7.1.2 --- Frequency of Path Relinking --- p.86 / Chapter 4.7.1.3 --- Size of Volatile Reference Set --- p.87 / Chapter 4.7.1.4 --- Size of Non-volatile Reference Set --- p.89 / Chapter 4.7.2 --- Comparisons with Other Algorithms --- p.94 / Chapter 5 --- Case Study --- p.98 / Chapter 5.1 --- Introduction --- p.98 / Chapter 5.2 --- Airport Background --- p.98 / Chapter 5.2.1 --- Layout of ICN --- p.98 / Chapter 5.3 --- Data Preparation --- p.99 / Chapter 5.3.1 --- Passenger Data --- p.103 / Chapter 5.4 --- Computational Studies --- p.104 / Chapter 5.4.1 --- Experiments without Airline Preference --- p.104 / Chapter 5.4.2 --- Experiments with Airline Preference --- p.106 / Chapter 5.4.2.1 --- Formulation --- p.106 / Chapter 5.4.2.2 --- Results --- p.108 / Chapter 5.5 --- Conclusion --- p.111 / Chapter 6 --- Conclusion --- p.112 / Chapter 6.1 --- Summary of Achievement --- p.112 / Chapter 6.2 --- Future Developments --- p.113 / Bibliography --- p.115 / Appendix --- p.119 / Chapter 1. --- Friedman´ةs Test --- p.119 / Chapter 2. --- Wilcoxon's Signed Rank Test for Paired Observation --- p.120 / Chapter 3. --- Hybrid Simulated Annealing with Tabu Search Approach --- p.121 / Chapter 4. --- Arrival Flight Data of Incheon International Airport --- p.122 / Chapter 5. --- Departure Flight Data of Incheon International Airport --- p.139

Thesis (Ph.D.)--Hong Kong Polytechnic University, 2006. / Adviser: Hing Keung William Lam. Includes bibliographical references.

Thesis (M.A.)--University of Hong Kong, 1994. / Includes bibliographical references (leaves 107-108). Also available in print.

Thesis (Ph.D)--Aerospace Engineering, Georgia Institute of Technology, 2010. / Committee Member: Dr. Fayette Collier; Committee Member: Prof. Daniel Schrage; Committee Member: Prof. Dimitri N. Mavris; Committee Member: Prof. John Leonard; Committee Member: Prof. John-Paul Clarke. Part of the SMARTech Electronic Thesis and Dissertation Collection.

本文分為個部分：多技能員工調問題，和集合覆蓋、裝運和劃分混合問題多面體研究，其中第一部分問題啟發我們第二部分的探。 / 首先，我們研究在一個大型機場的國際客運站中客戶服務人員的調問題。員工有同的技能和技能水平。技能定義是二維的，包括操作技能和語言能。在學模型中，我們也考慮用餐和休息時間的調和多處工作地點。我們證明該問題是NP-hard 的。我們推導出有效等式，以方計算過程。我們的學模型能夠幫助規劃者做出決策，及可計算同型的活性對業務的影響。我們的模型也可以幫助決策者計劃長遠工作調和培訓。 / 多技能人員調問題啟發我們這篇文的第二部分：集合覆蓋、裝運和劃分混合問題多面體研究。我們首先證明如覆蓋（或裝運）的等式被删去，該多面體是相當於一個放寬的裝運（或覆蓋）多面體的投影。然後我們考慮混合奇穴多面體（即是一個由覆蓋和裝運等式組成的多面體），並採用圖方法研究，通過考慮同型的等式的互動，推導出混合奇穴等式和完全描繪多面體的特徵。我們再推導出集合覆蓋和裝運混合問題的混合奇穴等式。計算結果顯示，混合奇穴等式有助於減少計算時間。我們還提供子明如何用等式幫助決策。 / This thesis is divided into two parts: Multi-Skilled Staff-Scheduling Problem and a polyhedral study on the Mixed Set Covering, Packing and Partitioning Problem, where the first part is a motivating example of the latter. / In the multi-skilled staff-scheduling problem, we study the problem of scheduling customer service agents at an international terminal of a large airport. The staff members are heterogeneous with different skills and skill levels. The skill specification is two-dimensional, defined by operational skills and language proficiency. In the mathematical model, we also consider the scheduling of meal and rest breaks, and multiple locations. The problem is shown to be NP-hard. We derive valid inequalities to speed up the computational procedure. With our mathematical model, we are able to help schedule planners make decisions and examine the impacts of different types of flexibility on the level of service provided. Our model can also help decision makers with long-term work-schedule planning. / Motivated by the staff-scheduling problem, the second part of this thesis studies the polyhedral structure of the mixed set covering, packing and partitioning problem, i.e., a problem that contains set covering, set packing and set partitioning constraints. We first study the mixed odd hole polytope, which is the polytope associated with a mixed odd hole consisting of covering and packing "edges". Adopting a graphical approach and considering the "interactions" between the different types of inequalities, we derive the mixed odd hole inequality, thereby completely characterizing the mixed odd hole polytope. We then generalize the mixed odd hole inequality for the general mixed covering and packing polytope. Computational results show that the mixed odd hole inequalities are helpful in reducing solution time. We also provide examples of problem settings in which the inequalities can be used to help decision making. / Detailed summary in vernacular field only. / Detailed summary in vernacular field only. / Detailed summary in vernacular field only. / Kuo, Yong Hong. / Thesis (Ph.D.)--Chinese University of Hong Kong, 2013. / Includes bibliographical references (leaves 119-129). / Abstracts also in Chinese. / Abstract --- p.i / Acknowledgement --- p.iii / Chapter I --- Scheduling of Multi-skilled Staff Across Multiple Locations --- p.1 / Chapter 1 --- Introduction --- p.2 / Chapter 2 --- Literature Review --- p.8 / Chapter 3 --- Mathematical Model --- p.14 / Chapter 3.1 --- Problem Formulation --- p.14 / Chapter 3.2 --- Valid Inequalities --- p.20 / Chapter 3.3 --- Shift Scheduling and Longer-Term Work-Schedule Planning --- p.21 / Chapter 4 --- Computational Studies --- p.24 / Chapter 4.1 --- Dataset and Input Parameters --- p.24 / Chapter 4.1.1 --- Staffing Requirements and Shortage Penalties --- p.24 / Chapter 4.2 --- Computational Study: Managerial Insights --- p.26 / Chapter 4.2.1 --- Effect of Three Types of Flexibility --- p.26 / Chapter 4.2.2 --- Impact of Different Types of Flexibility --- p.28 / Chapter 4.3 --- Computational Study: Benefits Compared with Benchmarks --- p.33 / Chapter 4.3.1 --- Heuristic H1: CSA Assignment by Time Period --- p.35 / Chapter 4.3.2 --- Heuristic H2: CSA Assignment by Criticality --- p.35 / Chapter 4.3.3 --- Comparison with Benchmarks --- p.37 / Chapter 4.4 --- Computational Study: Computational Efficiency --- p.40 / Chapter 5 --- Conclusions --- p.44 / Chapter II --- On the Polyhedral Structure of the Mixed Set Covering, Packing and Partitioning Polytope --- p.47 / Chapter 6 --- Introduction --- p.48 / Chapter 7 --- Preliminaries --- p.51 / Chapter 8 --- Overview of Packing, Covering and Partitioning Polyhedra --- p.58 / Chapter 8.1 --- Set Packing Polytope --- p.58 / Chapter 8.1.1 --- Intersection Graph --- p.59 / Chapter 8.1.2 --- Lifting Procedures --- p.63 / Chapter 8.1.3 --- Facet-Producing Subgraphs --- p.66 / Chapter 8.2 --- Set Covering Polytope --- p.71 / Chapter 8.2.1 --- Polyhedral Structure and the Associated Graphs --- p.71 / Chapter 8.3 --- Set Partitioning Polytope --- p.76 / Chapter 8.4 --- Blocking and Anti-Blocking Pairs --- p.78 / Chapter 8.4.1 --- Blocking polyhedra --- p.78 / Chapter 8.4.2 --- Anti-blocking polyhedra --- p.80 / Chapter 8.5 --- Perfect, Ideal and Balanced Matrices --- p.81 / Chapter 8.5.1 --- Perfect Matrices --- p.81 / Chapter 8.5.2 --- Ideal Matrices --- p.83 / Chapter 8.5.3 --- Balanced Matrices --- p.84 / Chapter 9 --- Mixed Set Covering, Packing and Partitioning Polytope --- p.87 / Chapter 9.1 --- Mixed Set Partitioning and Covering/Packing Polytope --- p.87 / Chapter 9.2 --- Mixed Set Covering and Packing Polytope --- p.88 / Chapter 9.2.1 --- Mixed odd hole --- p.90 / Chapter 9.2.2 --- General Mixed Covering and Packing Polytope --- p.97 / Chapter 9.3 --- Computational Experiments --- p.108 / Chapter 9.4 --- Applications of the Mixed Odd Hole Inequality --- p.112 / Chapter 9.4.1 --- Railway Time-Tabling --- p.112 / Chapter 9.4.2 --- Team Formation --- p.113 / Chapter 9.4.3 --- Course Registration --- p.114 / Chapter 10 --- Conclusions --- p.117 / Bibliography --- p.119

Not available / text

Thesis (Ph. D.)--Universität-Gesamthochschule-Siegen, 2007. / Includes bibliographical references (p. 123-129).

Thesis (DDes) - Faculty of Design, Swinburne University of Technology, 2008. / Submitted in partial fulfillment of the requirements of the degree of Professional Doctorate in Design, National Institute for Design Research, Faculty of Design, Swinburne University of Technology - 2008. Typescript. Submitted in partial fulfilment of the degree of Doctor of Design, Faculty of Design, Swinburne University of Technology, 2008. "June 2008". Bibliography: p. 137-147.