The purpose of this paper is to study the implementation of the legislatively-mandated labor protection provision incorporated in the Airline Deregulation Act of 1973. The case study contained herein describes and elucidates the implementation of the Airline Employee Protection Program at the U.S. Department of Labor.

No description available.

published_or_final_version / Business Administration / Master / Master of Business Administration

published_or_final_version / Business Administration / Master / Master of Business Administration

published_or_final_version / Business Administration / Master / Master of Business Administration

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.)--Oregon State University, 2009. / Printout. Includes bibliographical references. Also available on the World Wide Web.

Thesis (M. Arch.)--University of Hong Kong, 1995. / Includes special study report entitled: Movement analysis with respect to site circulation & interior circulation. Includes bibliographical references.

Written for the Institute of Air and Space Law. Title from title page of PDF (viewed 2010/03/31). Includes bibliographical references.

Thesis (M.B.A.)--University of Hong Kong, 1996. / Includes bibliographical references (leaf 84-85).