by Ha Yiu Cheung, Albert. / Thesis (M.B.A.)--Chinese University of Hong Kong, 1988. / Bibliography: leaves 90-94.

Yip Ka-yun. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1998. / Includes bibliographical references (leaves 107-113). / Abstract also in Chinese. / Chapter Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Overview --- p.1 / Chapter 1.2 --- Our Contributions --- p.2 / Chapter 1.3 --- Organization of the Thesis --- p.4 / Chapter Chapter 2 --- Literature Review --- p.5 / Chapter 2.1 --- Overview --- p.5 / Chapter 2.2 --- Research in Capacitated Lot Sizing Problem without significant setup times --- p.5 / Chapter 2.3 --- Research in Capacitated Lot Sizing Problem with setup time consideration --- p.12 / Chapter 2.4 --- Summary --- p.15 / Chapter Chapter 3 --- Capacitated Lot Sizing Problem with Setup Times --- p.16 / Chapter 3.1 --- Overview --- p.16 / Chapter 3.2 --- Problem Description and Formulation --- p.20 / Chapter 3.2.1 --- Our problem formulation / Chapter 3.2.2 --- Comparison between our problem formulation and traditional problem formulation / Chapter 3.3 --- Description of the Algorithm --- p.26 / Chapter 3.3.1 --- Wagner-Whitin algorithm / Chapter 3.3.2 --- Transportation problem / Chapter 3.3.3 --- Consistence test / Chapter 3.3.4 --- Subgradient optimization / Chapter 3.3.5 --- Computation of lower bound / Chapter 3.4 --- Design of Experiment --- p.43 / Chapter 3.4.1 --- Product demands / Chapter 3.4.2 --- Setup costs / Chapter 3.4.3 --- Setup times / Chapter 3.4.4 --- Capacity costs / Chapter 3.4.5 --- Inventory holding costs / Chapter 3.4.6 --- Quantity of capacity available for production / Chapter 3.4.7 --- Capacity absorption rate / Chapter 3.4.8 --- Generation of larger problems / Chapter 3.4.9 --- Initialization of Lagrangean multipliers / Chapter 3.4.10 --- Close test / Chapter 3.5 --- Open test --- p.58 / Chapter 3.6 --- Managerial Implications --- p.61 / Chapter 3.7 --- Summary --- p.61 / Chapter Chapter 4 --- Capacitated Lot Sizing Problem without Setup Times --- p.63 / Chapter 4.1 --- Overview --- p.63 / Chapter 4.2 --- Problem Description and Formulation --- p.64 / Chapter 4.3 --- Description of the Algorithm --- p.67 / Chapter 4.3.1 --- Decomposition scheme / Chapter 4.3.2 --- Wagner-Whitin algorithm / Chapter 4.3.3 --- Transportation problem / Chapter 4.3.4 --- Subgradient optimization / Chapter 4.3.5 --- Computation of lower bound / Chapter 4.4 --- Design of Experiment --- p.80 / Chapter 4.4.1 --- Product demands / Chapter 4.4.2 --- Setup costs / Chapter 4.4.3 --- Capacity costs / Chapter 4.4.4 --- Inventory holding costs / Chapter 4.4.5 --- Quantity of capacity available for production / Chapter 4.4.6 --- Capacity absorption rate / Chapter 4.4.7 --- Generation of larger problems / Chapter 4.4.8 --- Initialization of Lagrangean multipliers / Chapter 4.4.9 --- Selection of the extent of geometrical reduction and exponential smoothing / Chapter 4.4.10 --- Close test / Chapter 4.5 --- Open test --- p.92 / Chapter 4.6 --- Managerial Implications --- p.95 / Chapter 4.7 --- Comparison with other approaches --- p.96 / Chapter 4.7.1 --- Gilbert and Madan's approach / Chapter 4.7.2 --- Our algorithm for CLS problem with setup time consideration / Chapter 4.8 --- Summary --- p.102 / Chapter Chapter 5 --- Conclusion --- p.104 / Appendix A Vogel's approximation method --- p.106 / Bibliography --- p.107

published_or_final_version / abstract / Industrial and Manufacturing Systems Engineering / Master / Master of Philosophy

Chen, Jiayi. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2009. / Includes bibliographical references (p. 86-94). / Abstract also in Chinese. / Abstract --- p.i / Acknowledgement --- p.iv / Introduction --- p.1 / Chapter 1.1 --- Introduction to the Capacitated Lot Sizing (CLS )problem --- p.1 / Chapter 1.2 --- Our contributions --- p.2 / Chapter 1.3 --- Organization of the thesis --- p.4 / Literature Review --- p.5 / Chapter 2.1 --- Research in CLS problem --- p.5 / Chapter 2.1.1 --- Reviews in CLS problems --- p.8 / Chapter 2.1.2 --- Approaches and methods to solve the traditional CLS problems --- p.9 / Chapter 2.1.3 --- Research on Fixed-Charge-Transportation-typed models for CLS problems --- p.13 / Chapter 2.2 --- Research in Genetic Algorithm (GA) --- p.15 / Chapter 2.3 --- Conclusion --- p.17 / Problem Description and Formulation --- p.18 / Chapter 3.1 --- The formulation --- p.18 / Chapter 3.2 --- Comparison with the traditional formulation --- p.24 / Chapter 3.3 --- Conclusion --- p.28 / Description of the Heuristic --- p.29 / Chapter 4.1 --- Initialization --- p.32 / Chapter 4.1.1 --- Setup string generation --- p.32 / Chapter 4.1.2 --- Transportation problem --- p.35 / Chapter 4.1.3 --- Consistency test --- p.47 / Chapter 4.2 --- Selection --- p.50 / Chapter 4.3 --- Crossover --- p.50 / Chapter 4.4 --- Mutation --- p.52 / Chapter 4.5 --- Evaluation --- p.53 / Chapter 4.6 --- Termination --- p.54 / Chapter 4.7 --- Conclusion --- p.54 / Design of Experiments and Computational Results --- p.56 / Chapter 5.1 --- Design of experiments --- p.57 / Chapter 5.2 --- Discussion of lower bound procedures --- p.63 / Chapter 5.3 --- Computational results --- p.65 / Chapter 5.3.1 --- CLS problems with setup times --- p.65 / Chapter 5.3.2 --- CLS problems without setup times --- p.77 / Chapter 5.4 --- Conclusion --- p.82 / Conclusion --- p.83 / Bibliography --- p.86

published_or_final_version / Mathematics / Master / Master of Philosophy