To see the other types of publications on this topic, follow the link: Layout problem.

Dissertations / Theses on the topic 'Layout problem'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Layout problem.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Jaramillo, Juan R. "The generalized machine layout problem." Morgantown, W. Va. : [West Virginia University Libraries], 2007. https://eidr.wvu.edu/etd/documentdata.eTD?documentid=5504.

Full text
Abstract:
Thesis (Ph. D.)--West Virginia University, 2007.<br>Title from document title page. Document formatted into pages; contains xi, 86 p. : ill. Includes abstract. Includes bibliographical references (p. 82-86).
APA, Harvard, Vancouver, ISO, and other styles
2

Kanya, Denise L. "Preprocessing rules for the dynamic layout problem." Ohio : Ohio University, 1994. http://www.ohiolink.edu/etd/view.cgi?ohiou1177533808.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

St, Sauver Joseph E. "Parallel approaches to the facilities layout problem /." view abstract or download file of text, 1999. http://wwwlib.umi.com/cr/uoregon/fullcit?p9948030.

Full text
Abstract:
Thesis (Ph. D.)--University of Oregon, 1999.<br>Typescript. Includes vita and abstract. Includes bibliographical references (leaves 168-173). Also available for download via the World Wide Web; free to University of Oregon users. Address: http://wwwlib.umi.com/cr/uoregon/fullcit?p9948030.
APA, Harvard, Vancouver, ISO, and other styles
4

Kirkizoglu, Zeynep. "Modeling And Analysis Of The Facility Layout Problem." Master's thesis, METU, 2006. http://etd.lib.metu.edu.tr/upload/12607427/index.pdf.

Full text
Abstract:
The facilities layout problem, which is an integral part of facilities design, aims to spatially locate the production units within a facility subject to some design criteria and area limitations, with one or multiple objectives. In this study, the layout problem is reviewed in detail, with an emphasis on the dynamic environment it operates in. Despite the fact that layouts within the context of changing manufacturing requirements represent the problem better, the single period block layout problem is observed to have remained worth analyzing. In this thesis, a hybrid model that combines the s
APA, Harvard, Vancouver, ISO, and other styles
5

Liu, Wen-Hsing. "Tabu search heuristics for the dynamic facility layout problem." Morgantown, W. Va. : [West Virginia University Libraries], 2005. https://eidr.wvu.edu/etd/documentdata.eTD?documentid=3973.

Full text
Abstract:
Thesis (M.S.)--West Virginia University, 2005.<br>Title from document title page. Document formatted into pages; contains vii, 88 p. : ill. Includes abstract. Includes bibliographical references (p. 83-88).
APA, Harvard, Vancouver, ISO, and other styles
6

Loharjun, Pasu. "A decision theoretic approach to the general layout problem." Diss., Virginia Polytechnic Institute and State University, 1986. http://hdl.handle.net/10919/49824.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Oheba, Jamal Bashir. "A new framework considering uncertainty for facility layout problem." Thesis, University of Manchester, 2012. https://www.research.manchester.ac.uk/portal/en/theses/a-new-framework-considering-uncertainty-for-facility-layout-problem(7e0b665d-ed10-4355-a200-70d52d93eefe).html.

Full text
Abstract:
In today’s dynamic environment, where product demands are highly volatile and unstable, the ability to design and operate manufacturing facilities that are robust with respect to uncertainty and variability is becoming increasingly important to the success of any manufacturing firm in order to operate effectively in such an environment. Hence manufacturing facilities must be able to exhibit high levels of robustness and stability in order to deal with changing market demands. In general, Facility Layout Problem (FLP) is concerned with the allocation of the departments or machines in a facility
APA, Harvard, Vancouver, ISO, and other styles
8

Kuppusamy, Saravanan. "Simulated annealing heuristics for the dynamic facility layout problem." Morgantown, W. Va. : [West Virginia University Libraries], 2001. http://etd.wvu.edu/templates/showETD.cfm?recnum=2138.

Full text
Abstract:
Thesis (M.S.)--West Virginia University, 2001.<br>Title from document title page. Document formatted into pages; contains x, 133 p. : ill. Includes abstract. Includes bibliographical references (p. 88-94).
APA, Harvard, Vancouver, ISO, and other styles
9

Shang, Jin. "Ant colony heuristics for the dynamic facility layout problem." Morgantown, W. Va. : [West Virginia University Libraries], 2002. http://etd.wvu.edu/templates/showETD.cfm?recnum=2579.

Full text
Abstract:
Thesis (M.S.)--West Virginia University, 2002.<br>Title from document title page. Document formatted into pages; contains vii, 76 p. : ill. Includes abstract. Includes bibliographical references (p. 72-76).
APA, Harvard, Vancouver, ISO, and other styles
10

Jariwala, Anish. "Efficient branch and bound algorithm for the dynamic layout problem." Ohio : Ohio University, 1995. http://www.ohiolink.edu/etd/view.cgi?ohiou1179426531.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

Kusumah, Yaya S. "Graph theoretic based heuristics for the facility layout design problem." Thesis, Curtin University, 2001. http://hdl.handle.net/20.500.11937/1059.

Full text
Abstract:
The facility layout design problem is concerned with determining the arrangement and configuration of facilities, which optimizes a prescribed objective such as profit, cost, or distance, and which satisfies various prescribed constraints pertaining to available resources. In industry, facility layout design problems arise in manufacturing, in warehousing, and in various assignment type situations. The solution of these problems impacts on the viability of the industry. For example, material-handling costs which can comprise between 30 and 75% of the total manufacturing costs, can be reduced b
APA, Harvard, Vancouver, ISO, and other styles
12

Kusumah, Yaya S. "Graph theoretic based heuristics for the facility layout design problem." Curtin University of Technology, Department of Mathematics and Statistics, 2001. http://espace.library.curtin.edu.au:80/R/?func=dbin-jump-full&object_id=15301.

Full text
Abstract:
The facility layout design problem is concerned with determining the arrangement and configuration of facilities, which optimizes a prescribed objective such as profit, cost, or distance, and which satisfies various prescribed constraints pertaining to available resources. In industry, facility layout design problems arise in manufacturing, in warehousing, and in various assignment type situations. The solution of these problems impacts on the viability of the industry. For example, material-handling costs which can comprise between 30 and 75% of the total manufacturing costs, can be reduced b
APA, Harvard, Vancouver, ISO, and other styles
13

Ferreira, Fialho dos Anjos Miguel Nuno. "New convex relaxations for the maximum cut and VLSI layout problems." Thesis, Waterloo, Ont. : University of Waterloo, 2001. http://etd.uwaterloo.ca/etd/manjos2001.pdf.

Full text
Abstract:
Thesis (Ph.D.) - University of Waterloo, 2001.<br>"A thesis presented to the University of Waterloo in fulfilment of the thesis requirement for the degree of Doctor of Philosophy in Combinatorics and Optimization". Includes bibliographical references. Also available in microfiche format.
APA, Harvard, Vancouver, ISO, and other styles
14

Hakobyan, Artak. "Heuristics for the dynamic facility layout problem with unequal area departments." Morgantown, W. Va. : [West Virginia University Libraries], 2008. https://eidr.wvu.edu/etd/documentdata.eTD?documentid=5699.

Full text
Abstract:
Thesis (Ph. D.)--West Virginia University, 2008.<br>Title from document title page. Document formatted into pages; contains xiii, 109 p. : ill. (some col.). Includes abstract. Includes bibliographical references (p. 97-103).
APA, Harvard, Vancouver, ISO, and other styles
15

Marinchek, Dean A. "Manufacturing Facility Layout: A Methodology Incorporating Rotated Aisles into Layout Design." Ohio University / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1417537173.

Full text
APA, Harvard, Vancouver, ISO, and other styles
16

Ozen, Aykut. "Material Flow Cost Versus Congestion In Dynamic Distributed Facility Layout Problem." Master's thesis, METU, 2008. http://etd.lib.metu.edu.tr/upload/12609602/index.pdf.

Full text
Abstract:
In this thesis, we study both dynamic and distributed facility layout problems, where the demand for product mix changes over time. We propose a new simulated annealing algorithm, SALAB, for the dynamic facility layout problem. Four variants of SALAB find the best known solution for 20 of the 48 benchmark problems from the literature, improving upon the best known solutions of 18 problems. We modify SALAB to obtain DSALAB, solving the dynamic distributed facility layout problem with the objective of minimizing relocation cost and total (full and empty) travel cost of the material handling syst
APA, Harvard, Vancouver, ISO, and other styles
17

Hasda, Ranjan Kumar. "Contribution to the optimization of Unequal Area Rectangular Facility Layout Problem." Thesis, Ecole centrale de Nantes, 2017. http://www.theses.fr/2017ECDN0026.

Full text
Abstract:
L'agencement d'espace est un problème courant dans la plupart des secteurs industriels. Ce problème est de nature continue et discret et il est considéré comme un problème NP-difficile. Les méthodes d'optimisation traditionnelles, plus appropriées pour une recherche locale sont difficilement utilisables aux problèmes d'agencement. Afin de contourner ces limitations inhérentes aux méthodes classiques, nous proposons deux algorithmes adaptés aux problèmes d'agencement statique de composants de différentes tailles. Pour les problèmes d'agencement considérés, les fonctions objectives à minimiser s
APA, Harvard, Vancouver, ISO, and other styles
18

Bark, Ondřej. "Analysis of tracing and capacity utilization by handlers in production." Master's thesis, Vysoká škola ekonomická v Praze, 2015. http://www.nusl.cz/ntk/nusl-206141.

Full text
Abstract:
The diploma thesis focuses on tracing in layout by handlers between assembly lines in new plant for corporation Continental Automotive Czech Republic ltd, where boosters are produced. The theoretical part involves definitions of logistics, supply chain, material flow and handling equipment. Furthermore, methods of mathematic programming and software equipment are described, such as quadratic assignment problem, knapsack problem, travelling salesman problem from graph theory. In the practical part the situation in corporation has been analyzed and the data prepared for further examination. Then
APA, Harvard, Vancouver, ISO, and other styles
19

Mai, Dung Hoang. "A Heuristic for the Constrained One-Sided Two-Layered Crossing Reduction Problem for Dynamic Graph Layout." NSUWorks, 2011. http://nsuworks.nova.edu/gscis_etd/225.

Full text
Abstract:
Data in real-world graph drawing applications often change frequently but incrementally. Any drastic change in the graph layout could disrupt a user's "mental map." Furthermore, real-world applications like enterprise process or e-commerce graphing, where data change rapidly in both content and quantity, demand a comprehensive responsiveness when rendering the graph layout in a multi-user environment in real time. Most standard static graph drawing algorithms apply global changes and redraw the entire graph layout whenever the data change. The new layout may be very different from the previous
APA, Harvard, Vancouver, ISO, and other styles
20

Afsharian, Mohsen [Verfasser]. "The Two-Dimensional, Rectangular, Guillotineable-Layout Cutting Problem with Defects / Mohsen Afsharian." Aachen : Shaker, 2013. http://d-nb.info/1051575575/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
21

Jaramillo, Juan R. "A tabu search approach for the dynamic space allocation problem." Morgantown, W. Va. : [West Virginia University Libraries], 2002. http://etd.wvu.edu/templates/showETD.cfm?recnum=2712.

Full text
Abstract:
Thesis (M.S.)--West Virginia University, 2002.<br>Title from document title page. Document formatted into pages; contains xi, 87 p. : ill. Includes abstract. Includes bibliographical references (p. 84-87).
APA, Harvard, Vancouver, ISO, and other styles
22

Zhao, Zhengyang. "Optimizing Task Sequence and Cell Layout for Dual Arm Robot Assembly Using Constraint Programming." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-186593.

Full text
Abstract:
Nowadays, assembly robots are increasingly used in the manufacturing industry to replace or collaborate with human labors. This is the goal of the dual arm assembly robot developed by ABB. With the rapid upgrading in consumer electronics products, the lifetime of an assembly line could be only a few months. However, even for experienced programmers, to manually construct a good enough assembly sequence is time consuming, and the quality of the generated assembly sequence is not guaranteed. Moreover, a good robot assembly sequence is important to the throughput of an assembly line. For dual arm
APA, Harvard, Vancouver, ISO, and other styles
23

Gu, Jinxiang. "The forward reserve warehouse sizing and dimensioning problem." Diss., Available online, Georgia Institute of Technology, 2005, 2005. http://etd.gatech.edu/theses/available/etd-09092005-233231/.

Full text
Abstract:
Thesis (Ph. D.)--Industrial and Systems Engineering, Georgia Institute of Technology, 2006.<br>Joel Sokol, Committee Member ; Christiaan Paredis, Committee Member ; Gunter Sharp, Committee Member ; Marc Goetschalckx, Committee Chair ; Leon F. McGinnis, Committee Co-Chair. Includes bibliographical references.
APA, Harvard, Vancouver, ISO, and other styles
24

Khaewsukkho, Smart. "A Genetic Algorithm Implementation of Design Skeletons for Solving the Facility Layout Problem." The Ohio State University, 1999. http://rave.ohiolink.edu/etdc/view?acc_num=osu1396347382.

Full text
APA, Harvard, Vancouver, ISO, and other styles
25

Chraibi, Abdelahad. "A decision making system for operating theater design : application of facility layout problem." Thesis, Saint-Etienne, 2015. http://www.theses.fr/2015STET4017/document.

Full text
Abstract:
Dans les dernières décennies, l'augmentation de la consommation des services de soins et la croissance de la population ont fait de l'élimination du gaspillage et l'amélioration continue de la productivité de plus en plus cruciale pour les hôpitaux. La productivité et l'efficacité d'un hôpital dépendent des conditions de travail des soignants qui sont influencés fortement par l'organisation des lieux de travail et des installations [Dares (2013)]. L’agencement des installations consiste à "déterminer l'organisation physique d'un système de production et de trouver l’arrangement le plus efficac
APA, Harvard, Vancouver, ISO, and other styles
26

Andera, Timothy L. Rhodes Dent. "Using video to resolve an instructional problem in construction education." Normal, Ill. Illinois State University, 1994. http://wwwlib.umi.com/cr/ilstu/fullcit?p9510420.

Full text
Abstract:
Thesis (Ed. D.)--Illinois State University, 1994.<br>Title from title page screen, viewed March 23, 2006. Dissertation Committee: Dent M. Rhodes (chair), James L. Bradford, Kenneth F. Jerich, Larry D. Kennedy. Includes bibliographical references (leaves 127-131) and abstract. Also available in print.
APA, Harvard, Vancouver, ISO, and other styles
27

Liu, Qi. "A Sequence-Pair and Mixed Integer Programming Based Methodology for the Facility Layout Problem." Diss., Virginia Tech, 2004. http://hdl.handle.net/10919/29780.

Full text
Abstract:
The facility layout problem (FLP) is one of the most important and challenging problems in both the operations research and industrial engineering research domains. In FLP research, the continuous-representation-based FLP can consider all possible all-rectangular department solutions. Given this flexibility, this representation has become the representation of-choice in FLP research. Much of this research is based on a methodology of mixed integer programming (MIP) models. However, these MIP-FLP models can only solve problems with a limited number of departments to optimality due to a large nu
APA, Harvard, Vancouver, ISO, and other styles
28

Grover, Samir. "Solving layout compaction and wire-balancing problem using linear programming on the Monsoon multiprocessor." Thesis, Connect to online version, 1995. http://0-wwwlib.umi.com.mercury.concordia.ca/cr/concordia/fullcit?pMQ90885.

Full text
APA, Harvard, Vancouver, ISO, and other styles
29

Wilcock, Samuel Phillip. "A New Nonparametric Procedure for the k-sample Problem." Diss., Virginia Tech, 2001. http://hdl.handle.net/10919/28835.

Full text
Abstract:
The k-sample data setting is one of the most common data settings used today. The null hypothesis that is most generally of interest for these methods is that the k-samples have the same location. Currently there are several procedures available for the individual who has data of this type. The most often used method is commonly called the ANOVA F-test. This test assumes that all of the underlying distributions are normal, with equal variances. Thus the only allowable difference in the distributions is a possible shift, under the alternative hypothesis. Under the null hypothesis, it is assumed
APA, Harvard, Vancouver, ISO, and other styles
30

Jaén, Gómez Pedro Ildefonso. "Algoritmos híbridos para la resolución del F.L.P. (Facility Layout Problem) basados en colonias de hormigas." Doctoral thesis, Universitat Politècnica de València, 2016. http://hdl.handle.net/10251/59447.

Full text
Abstract:
[EN] The Facilities Layout Problem in a industrial plant (FLP) pursues the good ordenation of the integrating elements (that in this work they will call themselves facilities, understan-ding those elements of the production system that they require space) of a production system and it contemplates, among other, geometric and economic aspects. The eco-nomic aspect has to do with the installation of the plant and with its operation while the geometric one is related with the architecture of the system. Under consideration of these aspects they are derived different formulations of the problem ac
APA, Harvard, Vancouver, ISO, and other styles
31

Bagchi, Tanuj. "An Efficient Hybrid Heuristic and Probabilistic Model for the Gate Matrix Layout Problem in VLSI Design." Thesis, University of North Texas, 1993. https://digital.library.unt.edu/ark:/67531/metadc500878/.

Full text
Abstract:
In this thesis, the gate matrix layout problem in VLSI design is considered where the goal is to minimize the number of tracks required to layout a given circuit and a taxonomy of approaches to its solution is presented. An efficient hybrid heuristic is also proposed for this combinatorial optimization problem, which is based on the combination of probabilistic hill-climbing technique and greedy method. This heuristic is tested experimentally with respect to four existing algorithms. As test cases, five benchmark problems from the literature as well as randomly generated problem instances are
APA, Harvard, Vancouver, ISO, and other styles
32

Wang, Yuqiang. "Models and Algorithms for Some Combinatorial Optimization Problems: University Course Timetabling, Facility Layout and Integrated Production-Distribution Scheduling." Diss., Virginia Tech, 2007. http://hdl.handle.net/10919/28757.

Full text
Abstract:
In this dissertation, we address three different combinatorial optimization problems (COPs), each of which has specific real-life applications. Owning to their specific nature, these problems are different from those discussed in the literature. For each of these problems, we present a mathematical programming formulation, analyze the problem to determine its useful, inherent structural properties, and develop an efficient methodology for its solution by exploiting these properties. The first problem that we address is the course timetabling problem encountered at Virginia Tech. The course ti
APA, Harvard, Vancouver, ISO, and other styles
33

Keller, Birgit [Verfasser], Udo [Gutachter] Buscher, Rainer [Gutachter] Lasch, and Udo [Akademischer Betreuer] Buscher. "The single row layout problem with clearances / Birgit Keller ; Gutachter: Udo Buscher, Rainer Lasch ; Betreuer: Udo Buscher." Dresden : Technische Universität Dresden, 2019. http://d-nb.info/1226901247/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

Hung, Chuo-Shu, and 黃國書. "Closed-loop Layout Problem." Thesis, 1998. http://ndltd.ncl.edu.tw/handle/73024296660813817763.

Full text
APA, Harvard, Vancouver, ISO, and other styles
35

"On the dynamic layout problem." 1997. http://library.cuhk.edu.hk/record=b5889341.

Full text
Abstract:
Lau Chun Ming.<br>Thesis (M.Phil.)--Chinese University of Hong Kong, 1997.<br>Includes bibliographical references (leaves 122-125).<br>Chapter Chapter 1: --- Introduction --- p.1<br>Chapter 1.1 --- Overview --- p.1<br>Chapter 1.2 --- Static Plant Layout Problem --- p.1<br>Chapter 1.3 --- Dynamic Plant Layout Problem --- p.3<br>Chapter 1.4 --- Example Problem of SPLP --- p.4<br>Chapter 1.5 --- Formulation of SPLP --- p.7<br>Chapter 1.6 --- Example Problem of DPLP --- p.8<br>Chapter 1.7 --- Mathematical Model of DPLP --- p.12<br>Chapter 1.8 --- Characteristics of the DPLP --- p.13<br>Ch
APA, Harvard, Vancouver, ISO, and other styles
36

Ling, Yu Tzu, and 尤子玲. "The Adjacency-based Facility Layout Problem." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/73966309841458521672.

Full text
Abstract:
碩士<br>元智大學<br>工業工程與管理學系<br>90<br>Abstract The facility layout problem is to optimize the relative location of the departments with the minimum cost of either material handling or interactive cost. The effective layout of the facilities is one of the keys to the success of the production system for the poor layout and design will cost more and deteriorate the operational efficiency. Past researches were mostly focused on the quantitative measures (e.g., material handling cost), while few were concerned about the qualitative measures (e.g., adjacent closeness). This purpo
APA, Harvard, Vancouver, ISO, and other styles
37

Keller, Birgit. "The single row layout problem with clearances." Doctoral thesis, 2018. https://tud.qucosa.de/id/qucosa%3A34035.

Full text
Abstract:
The single row layout problem (SRLP) is a specially structured instance of the classical facility layout problem, especially used in flexible manufacturing systems. The SRLP consists of finding the most efficient arrangement of a given number of machines along one side of the material handling path with the purpose of minimising the total weighted sum of distances among all machine pairs. To reflect real manufacturing situations, a minimum space (so-called clearances) between machines may be required by observing technological constraints, safety considerations and regulations. This thesis int
APA, Harvard, Vancouver, ISO, and other styles
38

Sun, C. H., and 孫靜恆. "Multi-Objective Facility Layout Problem under Flexibility Consideration." Thesis, 1995. http://ndltd.ncl.edu.tw/handle/49352854537982489411.

Full text
Abstract:
碩士<br>國立交通大學<br>工業工程研究所<br>83<br>The result of facility layout will influence the performance of production system and is the key factor of deciding production cost. This paper presents a multi-objective facility layout model for combining quantitative factor (material handling cost) and qualitative factor (closeness rating). In this model, closeness rating is weighted by a cost parameter in order to reduce the influence of difference between two objective functions, and let the quality of
APA, Harvard, Vancouver, ISO, and other styles
39

Padgaonkar, Amol Shrikrishna. "Modeling and analysis of hospital facility layout problem." Thesis, 2004. http://library1.njit.edu/etd/fromwebvoyage.cfm?id=njit-etd2004-010.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

ZHANG, ZHUAN-JIE, and 張傳杰. "An expert system approach for machine layout problem." Thesis, 1990. http://ndltd.ncl.edu.tw/handle/36252687812393562865.

Full text
APA, Harvard, Vancouver, ISO, and other styles
41

Dahlbeck, Mirko. "Solution approaches for facility layout problems." Doctoral thesis, 2021. http://hdl.handle.net/21.11130/00-1735-0000-0005-155E-B.

Full text
APA, Harvard, Vancouver, ISO, and other styles
42

Adams, Elspeth. "A Semidefinite Programming Model for the Facility Layout Problem." Thesis, 2010. http://hdl.handle.net/10012/5398.

Full text
Abstract:
The continuous facility layout problem consists of arranging a set of facilities so that no pair overlaps and the total sum of the pairwise connection costs (proportional to the center-to-center rectilinear distance) is minimized. This thesis presents a completely mixed integer semidefinite programming (MISDP) model for the continuous facility layout problem. To begin we describe the problem in detail; discuss the conditions required for a feasible layout; and define quaternary variables. These variables are the basis of the MISDP model. We prove that the model is an exact formulation and a d
APA, Harvard, Vancouver, ISO, and other styles
43

MA, HSIAO-FENG, and 馬曉峰. "A Genetic Algorithm for The Construction Facility Layout Problem." Thesis, 2000. http://ndltd.ncl.edu.tw/handle/26422412155386879659.

Full text
Abstract:
碩士<br>朝陽大學<br>營建工程系碩士班<br>88<br>Construction site engineers have to face problems of allocating facilities to proper locations, which could maximize the productivity of construction sites. This kind of problems has not been easy to solve because the potential solution space usually is large. Genetic algorithms (GAs) are searching mechanisms based on nature selection, survival of the fittest, and theories of genes. GAs have proved to be efficient for solving large-scale optimization problems. A new genetic algorithm to improve efficiency in generating solutions for facility layout problems i
APA, Harvard, Vancouver, ISO, and other styles
44

Kao, Chi-Lun, and 高啟倫. "Applying Harmony Search Algorithm on the Facilities Layout Problem." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/29yt32.

Full text
Abstract:
碩士<br>國立臺北科技大學<br>工業工程與管理研究所<br>99<br>Facility Layout combines resource include human、material and equipment to be the most efficient planning, and balance other installation to transform well use for company in improve organize functions and development of long-term effectiveness. A good layout plan can improve the productivity and efficiency of information delivery; a bad one can obstruct the product process or waste superfluous material handling, increase the company operation cost. In reality, the academe and the industry all input considerable resources for FLP. Advanced scholars develop
APA, Harvard, Vancouver, ISO, and other styles
45

Tien, Wen-Jui, and 田文瑞. "Apply Heuristics for Solving the Stochastic Facility Layout Problem." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/g5gapz.

Full text
Abstract:
碩士<br>中原大學<br>工業工程研究所<br>102<br>Abstract Traditional facility layout problem assumes that all of the parameter are known. However in the real world, parameter such as demand of the product would always keep changing; this in result, will affect the production demand. Stochastic facility layout problem have the advantage, such that it can adapt over time subjected to the fluctuations in demand and in results would affect the production demand as well. To create more similar environment to real world scenario, the proposed study would use the stochastic facility layout problem to minimize mater
APA, Harvard, Vancouver, ISO, and other styles
46

Chao, Wen-Chi, and 趙文琦. "Using improved tabu search for the facility layout problem." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/28063114304467808216.

Full text
Abstract:
碩士<br>立德管理學院<br>應用資訊研究所<br>95<br>The facility layout problem is a part of the application in the artificial intelligence. It is belong to the combinatorial optimization and quadratic assignment problem. For many artificial intelligence tools, the tabu search algorithm is widely applied to a lot of combinatorial optimization problems. In this research, an improved tabu search algorithm is developed to solve a NP-complete problem in the facility layout problem. The approach on the two facilities layout problems is examined. The first one is a construction site layout problem, and the second one
APA, Harvard, Vancouver, ISO, and other styles
47

Tseng, Yi-Hsun, and 曾奕勳. "Apply multi-objective genetic algorithm to facility layout problem." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/20397310825426469427.

Full text
Abstract:
碩士<br>南台科技大學<br>工業管理研究所<br>97<br>Facility layout, the appropriateness of the decision of the entire production system of cost and efficiency, because a good layout mode will help to improve the efficiency of production systems and process on the manufacture, opposite poor layout mode will greatly reduce the efficiency of production. In the traditional solving facility layout mode, most are select one model to solve of qualitative or quantitative model. as a result of people who use quantitative model believe that the relationship between adjacent facilities, it is difficult to quantify the rea
APA, Harvard, Vancouver, ISO, and other styles
48

Keen, Patterson Margaret. "Cycle decomposition, Steiner trees, and the facility layout problem." 2003. https://scholarworks.umass.edu/dissertations/AAI3110541.

Full text
Abstract:
The facility layout problem is modelled as a cycle decomposition process in which the maximum-weight clique and travelling salesman problems are utilized to extract cycles from the graph adjacency matrix. The space between cycles is triangulated so the graph is maximally planar. The adjacency graph is then systematically developed into a block plan layout. With use of the maximum-weight clique algorithm, the procedure addresses layout problems that are not 100% dense. Many examples are utilized to demonstrate the flexibility of the algorithm and the resulting adjacency graph and block plan lay
APA, Harvard, Vancouver, ISO, and other styles
49

Wang, Ming-Jaan, and 王明展. "A Study of Facility Layout Problem by Genetic Algorithm." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/54442995428382781251.

Full text
Abstract:
博士<br>元智大學<br>工業工程與管理學系<br>91<br>A Study of Facility Layout Problem by Genetic Algorithm Student : Ming-Jaan Wang Advisor : Dr. Michael H. Hu Institute of Industrial Engineering and Management Yuan-Ze University ABSTRACT Minimal material handling cost (MHC) achievement is one of the critical objectives in facilities layout problems for layout designers. However, solving the larger departments of facilities layout problem accompanying with the optimal MHC is time-consuming or even infeasi
APA, Harvard, Vancouver, ISO, and other styles
50

Kuo, Chih-yang, and 郭志揚. "A Systematic Layout Planning / Analytic Hierarchy Process On Plant Layout Design Problem For Thin-film Solar Industry." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/55973579275849422108.

Full text
Abstract:
碩士<br>國立成功大學<br>工學院工程管理專班<br>97<br>Solar energy industry has been developed rapidly in recent years. They are required in the production technology to the way (Turn-key solution) that copy the same experience rapidly, so at this stage for the industry with high homogeneity. If we want to enhance our competitiveness nothing is better than from the manufacturing process is upgraded and lower production costs are reduced effectively .It is also base on plant facilities. Plant facilities layout (Layout) is always for the performance of manufacturing systems have a significant impact. The general l
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!