Algoritmo heurístico para la distribución en planta de células de trabajo.
- Francisco David de la Peña Esteban
- Máxima Juliana López Eguilaz
- Javier Caamaño Eraso
- Amaya Pérez Ezcurdia
Editorial: edUPV, Editorial Universitat Politècnica de València ; Universitat Politècnica de València
ISBN: 84-9705-987-5
Ano de publicación: 2006
Páxinas: 1878-1889
Congreso: CIDIP. Congreso Internacional de Ingeniería de Proyectos (10. 2006. Valencia)
Tipo: Achega congreso
Resumo
The objective of this paper is to show a new heuristic algorithm, which is able to make the layout of different manufacturing cells. It is supposed that we know the machines of every manufacturing cell, and also the parts that are manufactured en every one. Two hypotheses are considered: there is no space restriction and the areas of the manufacturing cells are different. As a result of the application of the algorithm, we will have the cells in their positions, and the machines in their positions inside every cell. All the machines in the beginning or end of a route are in the edge of the layout. The results are very satisfactory for less than 8 cells in these parameters: flow continuity and minimum material displacement.