Conecte-se

Bibliografias temáticas / Layout problems / Teses / dissertações

Siga este link para ver outros tipos de publicações sobre o tema: Layout problems.

Teses / dissertações sobre o tema "Layout problems"

Autor: Grafiati

Publicado: 12 de outubro de 2024

Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos

Selecione um tipo de fonte:

Veja os 50 melhores trabalhos (teses / dissertações) para estudos sobre o assunto "Layout problems".

Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.

Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.

Veja as teses / dissertações das mais diversas áreas científicas e compile uma bibliografia correta.

1

Narayanan, Venkataramani. "Design of hybrid layouts for large size facility layout problems." Thesis, Wichita State University, 2007. http://hdl.handle.net/10057/1544.

Texto completo da fonte

Resumo:

Generally facility layout problems are solved traditionally using assembly layout or process layout or cellular layout. Hybrid layouts are layouts that combine all three traditionally layouts considering product characteristics and capacity requirements. In this research, a systematic methodology to design the hybrid layouts is performed. The need for developing a hybrid layout is justified based on the product routing and layout requirements. The size of the problem is minimized using product analysis techniques which also minimizes the computational time. New similarity measures are develope

Estilos ABNT, Harvard, Vancouver, APA, etc.

2

Narayanan, Venkataramani Krishnan Krishna K. "Design of hybrid layouts for large size facility layout problems /." Thesis, A link to full text of this thesis in SOAR, 2007. http://hdl.handle.net/10057/1544.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

3

Sprague, Alan P. "Problems in VLSI layout design /." The Ohio State University, 1988. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487597424138645.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

4

Ren, Jintong. "Optimization algorithms for graph layout problems." Thesis, Angers, 2020. https://tel.archives-ouvertes.fr/tel-03178385.

Texto completo da fonte

Resumo:

Cette thèse considère deux problèmes de disposition des graphes : le problème de la bande passante cyclique (CBP) et le problème de l’agencement linéaire minimum (MinLA). Le CBP est une extension naturelle du problème de minimisation de la bande passante (BMP) et le MinLA est un problème de somme minimale. Ces problèmes sont largement appliqués dans la vie réelle. Puisqu’ils sont NP-difficile, il est difficile de les résoudre dans le cas général. Par conséquent, cette thèse est consacrée au développement d’algorithmes heuristiques efficaces pour faire face à ces problèmes. Plus précisément, no

Estilos ABNT, Harvard, Vancouver, APA, etc.

5

Dahlbeck, Mirko [Verfasser]. "Solution approaches for facility layout problems / Mirko Dahlbeck." Göttingen : Niedersächsische Staats- und Universitätsbibliothek Göttingen, 2021. http://d-nb.info/1226425682/34.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

6

Traversi, Emiliano <1981&gt. "Orientation and layout problems on graphs, with applications." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2010. http://amsdottorato.unibo.it/2637/2/traversi_emiliano_tesi.pdf.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

7

Traversi, Emiliano <1981&gt. "Orientation and layout problems on graphs, with applications." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2010. http://amsdottorato.unibo.it/2637/.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

8

Gamot, Juliette. "Algorithms for Conditional Search Space Optimal Layout Problems." Electronic Thesis or Diss., Université de Lille (2022-....), 2023. http://www.theses.fr/2023ULILB042.

Texto completo da fonte

Resumo:

Cette thèse s'inscrit dans le cadre de l'optimisation d'agencement, une étape importante dans la conception de systèmes multidisciplinaires complexes tels que les véhicules aérospatiaux. Les problèmes d'agencement optimal (OLP) consistent à trouver la meilleure disposition d'un ensemble de composants dans un système ou un espace, afin d'atteindre certains objectifs (réduction des coûts, amélioration des performances, etc.) tout en satisfaisant diverses contraintes (géométriques, fonctionnelles, etc.). Le traitement des OLP est encore un défi aujourd'hui, tant en termes de formulation que de ré

Estilos ABNT, Harvard, Vancouver, APA, etc.

9

Freire, Marco. "Layout problems under topological constraints for computational fabrication." Electronic Thesis or Diss., Université de Lorraine, 2024. http://www.theses.fr/2024LORR0073.

Texto completo da fonte

Resumo:

Les problèmes d'agencement surviennent dans de nombreux contextes en ingénierie et en informatique. Typiquement, la résolution d'un problème d'agencement consiste en l'organisation spatiale et l'interconnexion d'un ensemble d'éléments dans un espace. Cet espace et ces interconnexions peuvent être de complexité très variable. Un ensemble de contraintes et d'objectifs complémentent la description du problème, tels que minimiser la longueur ou la surface des interconnexions, ou fixer la position de certains éléments. La planification des étages en architecture, de niveaux de jeux vidéo, l'agencem

Estilos ABNT, Harvard, Vancouver, APA, etc.

10

Finney, Andrew Martin. "The application of graph algorithms to VLSI layout." Thesis, Brunel University, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.235887.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

11

Jaganathan, Jai Kannan Janaki Krishnan Krishna K. "Solution to large facility layout problems using group technology." Diss., A link to full text of this thesis in SOAR, 2007. http://soar.wichita.edu/dspace/handle/10057/1139.

Texto completo da fonte

Resumo:

Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Industrial and Manufacturing Engineering.<br>"May 2007." Title from PDF title page (viewed on Dec. 26, 2007). Thesis adviser: Krishna K. Krishnan. Includes bibliographic references (leaves 113-120).

Estilos ABNT, Harvard, Vancouver, APA, etc.

12

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.

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

13

Nayak, Chandan N. "Solutions to dynamic facility layout problems: Development of Dynamic From Between Chart (DFBC) and its applications to continuous layout modeling." Diss., Wichita State University, 2007. http://hdl.handle.net/10057/1493.

Texto completo da fonte

Resumo:

Manufacturing facility layout is determined by minimizing the Material Handling (MH) cost associated with the manufacturing of products. A manufacturing facility operates in a dynamic environment where the production rates and product mix are continuously changing. In addition, the introduction of new products/machines and removal of existing products/machines render the existing layout completely unreliable to yield improved productivity. Hence, it is often necessary to analyze the current layout and redesign the layout in accordance with the constantly changes in demand. Existing methods for

Estilos ABNT, Harvard, Vancouver, APA, etc.

14

Nayak, Chandan N. Krishnan Krishna. "Solutions to dynamic facility layout problems: Development of Dynamic From Between Chart (DFBC) and its applications to continuous layout modeling /." Diss., A link to full text of this thesis in SOAR, 2007. http://hdl.handle.net/10057/1493.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

15

Mitwasi, Mousa George 1964. "INTEGRATED FORMULATION FOR THE FACILITIES LAYOUT, PROCESS SELECTION, AND PRODUCTION PLANNING PROBLEMS." Thesis, The University of Arizona, 1987. http://hdl.handle.net/10150/276477.

Texto completo da fonte

Resumo:

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 algorith

Estilos ABNT, Harvard, Vancouver, APA, etc.

16

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.

Texto completo da fonte

Resumo:

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

Estilos ABNT, Harvard, Vancouver, APA, etc.

17

Fraticelli, Barbara M. P. "Semidefinite Cuts and Partial Convexification Techniques with Applications to Continuous Nonconvex Optimization, Stochastic Integer Programming, and Facility Layout Problems." Diss., Virginia Tech, 2001. http://hdl.handle.net/10919/27293.

Texto completo da fonte

Resumo:

This dissertation develops efficient solution techniques for general and problem-specific applications within nonconvex optimization, exploiting the constructs of the Reformulation-Linearization Technique (RLT). We begin by developing a technique to enhance general problems in nonconvex optimization through the use of a new class of RLT cuts, called semidefinite cuts. While these cuts are valid for any general problem for which RLT is applicable, we demonstrate their effectiveness in optimizing a nonconvex quadratic objective function over a simplex. Computational results indicate that on a

Estilos ABNT, Harvard, Vancouver, APA, etc.

18

Daraei, Maryam. "Warehouse Redesign Process: A case study at Enics Sweden AB." Thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-19508.

Texto completo da fonte

Resumo:

Nowadays warehousing became one of the most important and critical part in supply chain systems due to the fact that it consumes a considerable part of logistic cost. Designing phase of warehousing system is the most important part in warehousing since most of the strategic and tactical decisions should be taken in this phase. Majority of academic papers are primarily analysis oriented and does not give a systematic method and techniques as a basis for warehouse redesign. So there is a need to develop a structured procedure that can be applied for different type of warehouses. Therefore the pu

Estilos ABNT, Harvard, Vancouver, APA, etc.

19

Theophil, Sebastian Christoph [Verfasser], Hans-Dieter [Akademischer Betreuer] Burkhard, Markus [Akademischer Betreuer] Hannebauer, and Irfan [Akademischer Betreuer] Essa. "Sketching Slides : interactive creation and automatic solution of constrained document layout problems / Sebastian Christoph Theophil. Gutachter: Hans-Dieter Burkhard ; Markus Hannebauer ; Irfan Essa." Berlin : Humboldt Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2011. http://d-nb.info/1015169252/34.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

20

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.

Texto completo da fonte

Resumo:

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).

Estilos ABNT, Harvard, Vancouver, APA, etc.

21

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

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

22

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.

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

23

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.

Texto completo da fonte

Resumo:

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

Estilos ABNT, Harvard, Vancouver, APA, etc.

24

CELLIN, B. P. "Métodos para Resolução eficiente de Problemas de Layout." Universidade Federal do Espírito Santo, 2017. http://repositorio.ufes.br/handle/10/9845.

Texto completo da fonte

Resumo:

Made available in DSpace on 2018-08-02T00:03:48Z (GMT). No. of bitstreams: 1 tese_11024_Versão final20171016-125639.pdf: 596775 bytes, checksum: a1c4f15b568902f72ff12a0c184c56a6 (MD5) Previous issue date: 2017-03-30<br>Em sistemas produtivos onde a diminuição dos custos de produção é vista como peça chave na estratégia competitiva, a otimização entra como uma importante ferramenta para auxiliar as empresas nesse processo de sobrevivência e expansão no mercado. Na indústria surgem muitos problemas de Layout, os quais são problemas de otimização que se caracterizam pelo arranjo físico de f

Estilos ABNT, Harvard, Vancouver, APA, etc.

25

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.

Texto completo da fonte

Resumo:

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

Estilos ABNT, Harvard, Vancouver, APA, etc.

26

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.

Texto completo da fonte

Resumo:

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).

Estilos ABNT, Harvard, Vancouver, APA, etc.

27

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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

28

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.

Texto completo da fonte

Resumo:

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

Estilos ABNT, Harvard, Vancouver, APA, etc.

29

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.

Texto completo da fonte

Resumo:

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).

Estilos ABNT, Harvard, Vancouver, APA, etc.

30

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.

Texto completo da fonte

Resumo:

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).

Estilos ABNT, Harvard, Vancouver, APA, etc.

31

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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

32

PERMANHANE, R. M. "Problemas de Layout: Aplicações para CAP e para o DRLP." Universidade Federal do Espírito Santo, 2016. http://repositorio.ufes.br/handle/10/9841.

Texto completo da fonte

Resumo:

Made available in DSpace on 2018-08-02T00:03:48Z (GMT). No. of bitstreams: 1 tese_10473_Rafael Marin.pdf: 645952 bytes, checksum: fb1d2d215c00488c495d10075dccff4a (MD5) Previous issue date: 2016-11-08<br>Foram estudados alguns problemas de layout e escolhidos dois deles:o Corridor Allocation Problem (CAP) e o Doble Row Layout Problem (DRLP). O CAP e o DRLP são NP-Difíceis em diversas situações do mundo real. Os problemas foram resolvidos com a utilização das metas-heurísticas Iterated Local Search e Variable Neighbouhood Descent e a sua hibridização.

Estilos ABNT, Harvard, Vancouver, APA, etc.

33

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

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

34

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.

Texto completo da fonte

Resumo:

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

Estilos ABNT, Harvard, Vancouver, APA, etc.

35

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.

Texto completo da fonte

Resumo:

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

Estilos ABNT, Harvard, Vancouver, APA, etc.

36

Ivanqui, Ivan Ludgero. "Um modelo para solução do problema de arranjo físico de instalações interligadas por corredores /." Florianópolis, SC, 1997. http://repositorio.ufsc.br/xmlui/handle/123456789/77147.

Texto completo da fonte

Resumo:

Tese (Doutorado) - Universidade Federal de Santa Catarina, Centro Tecnológico.<br>Made available in DSpace on 2012-10-17T01:18:12Z (GMT). No. of bitstreams: 0Bitstream added on 2016-01-08T22:36:52Z : No. of bitstreams: 1 138083.pdf: 2606826 bytes, checksum: 9d4f32b3f343f3ec129e261d64218ca7 (MD5)

Estilos ABNT, Harvard, Vancouver, APA, etc.

37

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.

Texto completo da fonte

Resumo:

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).

Estilos ABNT, Harvard, Vancouver, APA, etc.

38

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.

Texto completo da fonte

Resumo:

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

Estilos ABNT, Harvard, Vancouver, APA, etc.

39

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.

Texto completo da fonte

Resumo:

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

Estilos ABNT, Harvard, Vancouver, APA, etc.

40

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.

Texto completo da fonte

Resumo:

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

Estilos ABNT, Harvard, Vancouver, APA, etc.

41

Almeida, Sheila Souza de. "Otimização de layout de plantas quimicas utilizando o problema de designação quadratica." [s.n.], 2008. http://repositorio.unicamp.br/jspui/handle/REPOSIP/267187.

Texto completo da fonte

Resumo:

Orientador: Reginaldo Guirardello<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Quimica<br>Made available in DSpace on 2018-08-12T13:45:38Z (GMT). No. of bitstreams: 1 Almeida_SheilaSouzade_M.pdf: 1636225 bytes, checksum: 745e0149ac6b7b1271674496404c47e9 (MD5) Previous issue date: 2008<br>Resumo: O Layout de uma indústria é de grande preocupação no seu desenvolvimento e, por este motivo, engenheiros e pesquisadores vêm cada vez mais se aprofundando no assunto. A escolha de um bom Layout tem influência nos custos, na segurança, operação e manutenção qu

Estilos ABNT, Harvard, Vancouver, APA, etc.

42

Davi, André da Silva. "Uma aplicação de metaheurísticas na abordagem do problema de layout de armazém." Universidade do Vale do Rio dos Sinos, 2017. http://www.repositorio.jesuita.org.br/handle/UNISINOS/6802.

Texto completo da fonte

Resumo:

Submitted by JOSIANE SANTOS DE OLIVEIRA (josianeso) on 2017-11-29T16:00:55Z No. of bitstreams: 1 André da Silva Davi_.pdf: 2370087 bytes, checksum: dcaf9c82247a500748da7c104102054b (MD5)<br>Made available in DSpace on 2017-11-29T16:00:55Z (GMT). No. of bitstreams: 1 André da Silva Davi_.pdf: 2370087 bytes, checksum: dcaf9c82247a500748da7c104102054b (MD5) Previous issue date: 2017-09-12<br>Nenhuma<br>Neste trabalho foi desenvolvido um modelo computacional para a otimização de layout de um Armazém. Além da abordagem do Problema de Layout de Armazém, também é abordado o Problema de Família

Estilos ABNT, Harvard, Vancouver, APA, etc.

43

Franceira, Sergio Norival. "Otimização de layout de plantas quimicas utilizando o problema de designação quadratico." [s.n.], 2001. http://repositorio.unicamp.br/jspui/handle/REPOSIP/266421.

Texto completo da fonte

Resumo:

Orientador: Reginaldo Guirardello<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Quimica<br>Made available in DSpace on 2018-07-27T15:25:01Z (GMT). No. of bitstreams: 1 Franceira_SergioNorival_M.pdf: 3731488 bytes, checksum: d7857c421064b5382fefae40ea456256 (MD5) Previous issue date: 2001<br>Resumo<br>Abstract<br>Mestrado<br>Desenvolvimento de Processos Químicos<br>Mestre em Engenharia Química

Estilos ABNT, Harvard, Vancouver, APA, etc.

44

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.

Texto completo da fonte

Resumo:

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

Estilos ABNT, Harvard, Vancouver, APA, etc.

45

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

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

46

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

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

47

Lu, Ying-I., and 呂英毅. "Assembly Layout Problems for Secondary Battery Products." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/57k62d.

Texto completo da fonte

Resumo:

碩士<br>逢甲大學<br>工業工程學所<br>90<br>Abstract We have developed an solution framework for solving assembly layout problems of secondary battery products. A two-stage approach have been proposed to resolve this problem. In the first stage, a heuristic is developed that finds an initial group of products. Then an optimal group of production lines is obtained under the consideration of factory area and capacity constraints and the minimum invest cost. This approach reduces set-up time while fixing the machine position. Such a solution can avoid any damage that might result from moving machines during pr

Estilos ABNT, Harvard, Vancouver, APA, etc.

48

Chih-Tsung, Tsai, and 蔡志宗. "A study of space layout planning problems." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/9hve83.

Texto completo da fonte

Resumo:

碩士<br>國立臺北科技大學<br>經營管理系碩士班<br>103<br>A space layout planning problem focuses on how to find an optimal layout of a given space in the limited resources and specific conditions. Although many methods have been proposed to solve this problem, for example: the enumerative method and various heuristic algorithms, they cannot guarantee the quality of the solution obtained or solve the problem efficiently. Therefore, how to find an optimal space layout within a reasonable time becomes an important issue. This study proposes a deterministic optimization approach to solve this problem. According to th

Estilos ABNT, Harvard, Vancouver, APA, etc.

49

Yang, Feng-Kai, and 楊豐愷. "Study of Facility Layout Problems with Aisle Construction." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/87251415014352203769.

Texto completo da fonte

Resumo:

碩士<br>華梵大學<br>工業管理學系碩士班<br>90<br>This thesis proposes an intelligent aisle construction system for automated facility layout problem with indoor and outdoor consideration. So the proposed system not only generates a layout but also suggests the space and distribution of aisles and indoors. The objective function is to minimize material handling cost and aisle space requirement. Therefore, the theory of shortest path, genetic algorithm (GA), and heuristic rules were combined to derive a hybrid genetic algorithm (HGA), which will efficiently suggest layouts with door and aisle structure.

Estilos ABNT, Harvard, Vancouver, APA, etc.

50

Jaganathan, Jai Kannan Janaki. "Solution to large facility layout problems using group technology." Thesis, 2007. http://hdl.handle.net/10057/1139.

Texto completo da fonte

Resumo:

In this work, a systematic methodology to construct cellular layouts using GT technique for large size problems has been developed. Previous researches in this field have addressed heuristics that can be used to solve only medium size problems. A mathematical model that uses reduced intercellular count as a criterion for cell formation is developed. The developed model includes details like machine sequence, production volume and machine revisits for formation of cells. A performance measure that is used to evaluate the cells being formed is proposed after some modifications in the existing me

Estilos ABNT, Harvard, Vancouver, APA, etc.

Oferecemos descontos em todos os planos premium para autores cujas obras estão incluídas em seleções literárias temáticas. Contate-nos para obter um código promocional único!