No description available.

No description available.

No description available.

No description available.

Thesis (M.S.)--Ohio University, November, 1995. / Title from PDF t.p.

This study presents five supporting programs in the area of facility layout design. Programs are "stand alone" adapted type which cover data analysis and analytical techniques. Programs are From/To (From/To Chart generator), CRAFT* (Computerized Relative Allocation of Facilities Technique), RELVAL (Relationship Chart generator), CORELAP* (Computerized Relationship Layout Planning), and EVAL (Layout Evaluation program). Theory, complete program documentation, and case example for each program are presented. Programs are written in an interactive basic mode and have been tested on the Apple II Plus system.

In this thesis we present an integrated formulation for production planning, facilities layout and process selection and provide two heuristics for solving the integrated problem. The traditional solution procedures to each of the subproblems are discussed. The decisions modeled in these three problems are interrelated and, in some cases, share overlapping data requirements. The integrated formulation provided is a mixed integer program. Solving this mixed integer program optimally is a hard problem. Thus, in this thesis we only provide heuristic solutions. An optimal branch and bound algorithm is suggested. Both heuristic solutions are demonstrated on a sample problem. The results of testing eight problems is recorded. Further suggestions for improving the heuristic solutions are also provided.

published_or_final_version / Industrial Engineering / Master / Master of Science in Engineering

Typescript (photocopy). / Digitized by Kansas Correctional Industries

Lau Chun Ming. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1997. / Includes bibliographical references (leaves 122-125). / Chapter Chapter 1: --- Introduction --- p.1 / Chapter 1.1 --- Overview --- p.1 / Chapter 1.2 --- Static Plant Layout Problem --- p.1 / Chapter 1.3 --- Dynamic Plant Layout Problem --- p.3 / Chapter 1.4 --- Example Problem of SPLP --- p.4 / Chapter 1.5 --- Formulation of SPLP --- p.7 / Chapter 1.6 --- Example Problem of DPLP --- p.8 / Chapter 1.7 --- Mathematical Model of DPLP --- p.12 / Chapter 1.8 --- Characteristics of the DPLP --- p.13 / Chapter 1.9 --- Constrained Dynamic Plant Layout Problem (CDPLP) --- p.14 / Chapter 1.10 --- Mathematical Model of CDPLP --- p.14 / Chapter 1.11 --- Objective of the Research --- p.15 / Chapter 1.12 --- Conclusion --- p.16 / Chapter Chapter 2: --- Literature Review --- p.17 / Chapter 2.1 --- Overview --- p.17 / Chapter 2.2 --- Static Plant Layout Problem (SPLP) --- p.17 / Chapter 2.2.1 --- The optimal algorithms / Chapter 2.2.2 --- The sub-optimal algorithms / Chapter 2.2.3 --- Construction algorithms / Chapter 2.2.4 --- Improvement algorithms / Chapter 2.3 --- Dynamic Plant Layout Problem (DPLP) --- p.21 / Chapter 2.4 --- Conclusion: --- p.26 / Chapter Chapter 3: --- Genetic Algorithms in DPLP --- p.27 / Chapter 3.1 --- Introduction of Genetic Algorithms --- p.27 / Chapter 3.2 --- Genetic Algorithms in DPLP --- p.28 / Chapter 3.2.1 --- Encoding of a solution / Chapter 3.2.2 --- Fitness function / Chapter 3.2.3 --- Crossover operator / Chapter 3.2.4 --- Selection scheme / Chapter 3.2.5 --- Replacement and reproduction / Chapter 3.2.6 --- Mutation / Chapter 3.2.7 --- Initialization of parent pool / Chapter 3.2.8 --- Termination criterion / Chapter 3.3 --- Summary of the Proposed Method --- p.50 / Chapter Chapter 4: --- Computational Result of GA in DPLP --- p.51 / Chapter 4.1 --- Overview --- p.51 / Chapter 4.2 --- Characteristics of the Testing Problems --- p.51 / Chapter 4.3 --- Mathematical Model of DPLP for the Testing Problem --- p.52 / Chapter 4.4 --- The Design of Experiment --- p.53 / Chapter 4.4.1 --- The experiment / Chapter 4.4.2 --- Generating the initial layouts: / Chapter 4.5 --- Result: --- p.56 / Chapter 4.6 --- Analysis of Results --- p.60 / Chapter 4.6.1 --- 6department problems / Chapter 4.6.2 --- 15and 30 department problems / Chapter 4.7 --- Conclusion --- p.66 / Chapter Chapter 5: --- Constrained Dynamic Plant Layout Problem --- p.68 / Chapter 5.1 --- Overview --- p.68 / Chapter 5.2 --- The Mathematical Model of CDPLP --- p.69 / Chapter 5.3 --- Properties of CDPLP --- p.69 / Chapter 5.4 --- The Proposed GA on CDPLP --- p.71 / Chapter 5.4.1 --- Introduction / Chapter 5.4.2 --- Procedure / Chapter 5.4.3 --- Properties of dynamic programming under the dummy periods / Chapter 5.4.4 --- Properties of the proposed GA under the dummy periods / Chapter 5.4.5 --- The maximum number of iteration for the procedure / Chapter 5.5 --- Design of Experiment --- p.78 / Chapter 5.6 --- Result of Experiment on CDPLP --- p.81 / Chapter 5.7 --- Analysis of Results --- p.91 / Chapter 5.7.1 --- Type 1 budget (self): / Chapter 5.7.2 --- The average cost of the test / Chapter 5.8 --- Conclusion: --- p.93 / Chapter Chapter 6: --- Conclusion --- p.94 / Appendix A: The Improved Implementation for Conway and Venkataramanan's GA --- p.96 / Appendix B: Computational Result for CDPLP --- p.98 / Bibliography --- p.122