نتایج جستجو برای: facilities layout problems

تعداد نتایج: 674153  

One of the well-known evolutionary algorithms inspired by biological evolution is genetic algorithm (GA) that is employed as a robust and global optimization tool to search for the best or near-optimal solution with the search space. In this paper, this algorithm is used to solve unequalsized machines (or intra-cell) layout problems considering pick-up and drop-off (input/output) points. Such p...

Journal: :IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 2002

Journal: :Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 2007

2013
R. M. A. SILVA

This paper proposes a mathematical formulation for the facility layout problem (FLP) based on the generalized quadratic assignment problem (GQAP). The GQAP is a generalization of the NP-hard quadratic assignment problem (QAP) that allows multiple facilities to be assigned to a single location as long as the capacity of the location allows. As a case study, we adapt the GRASP with path-relinking...

Journal: :Integration 1991
Michael R. Fellows Michael A. Langston

2015
Anja Fischer Frank Fischer Philipp Hungerländer

Given a set of departments, a number of rows and pairwise connectivities between these departments, the multi-row facility layout problem (MRFLP) looks for a non-overlapping arrangement of these departments in the rows such that the weighted sum of the center-to-center distances is minimized. As even small instances of the (MRFLP) are rather challenging, several special cases have been consider...

Journal: :IEEE Computer 1989
Jeff Kramer Jeff Magee Keng Ng

In systems engineering, considerable advantages accrue by constructing and managing the system in terms of its software configuration; that is the set of constituent software components together with their control and communication interconnections. A specification of the system configuration can be used both to describe the required system structure and for actual system construction. Manageme...

Journal: :Networks 2002
Eduardo Uchoa Marcus Poggi de Aragão Celso C. Ribeiro

VLSI layout applications yield instances of the Steiner tree problem over grid graphs with holes, which are considered hard to be solved by current methods. In particular, preprocessing techniques developed for Steiner problems over general graphs are not likely to reduce signiicantly such VLSI instances. We propose a new preprocessing procedure, combining earlier ideas from the literature to m...

Journal: :Bulletin of the EATCS 2011
Jordi Petit

In 2002, J. Díaz, M. Serna and the author published “A Survey of Graph Layout Problems”, which then was a complete view of the current state of the art of layout problems from an algorithmic point of view. The current review expands the contents of the original survey with updated results from these latest ten years and contributes an extensive bibliography.

Journal: :Procedia of Engineering and Life Science 2023

Re-Layout finished paint warehouse use method Systematic Layout Planning (SLP) and Shared Storage could reduce wastage caused by layout lack of facilities max, for example distance long cause fare material handling Becomes big heaps or arrangement that is not efficient.From result study Re - done obtained results efficiency as much 59.74% initial 25,967 m to 10,452 after proposal take effect ev...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید