An efficient tabu algorithm for the single row facility layout problem

Samarghandi, Hamed; Eshghi, Kourosh

doi:10.1016/j.ejor.2009.11.034

Cited by 105 publications

(60 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…La evaluación del estado actual de la compañía permitió identificar que existe una estación que genera retrasos en el sistema general y que requiere la ejecución de cantidades considerables de unidades, como las estaciones planchas. Tal como lo proponen algunos autores [24], una alternativa de solución posible es incrementar el número de recursos que producen retrasos.…”

Section: Trabajos Completadosunclassified

Análisis del proceso productivo de una empresa de confecciones: Modelación y simulación

Sánchez¹,

Ceballos

Torres

2015

Cien.Ing.Neogranadina

View full text Add to dashboard Cite

<p class="Texto">El modelado y simulación de pequeños sistemas industriales ha adquirido gran importancia en los procesos de toma de decisiones, toda vez que les permite a microempresas fundamentar sus decisiones de producción. Este artículo hace un análisis de una empresa dedicada a la confección de ropa exterior masculina con una producción semanal promedio de 490 prendas. La motivación del estudio radica en el interés de incrementar su productividad; por esto, se desarrolló un modelo del sistema real con la herramienta Arena®, logrando identificar las partes de los procesos responsables de atrasos y “cuellos de botella” que permitieron plantear el escenario de solución. Este documento muestra los resultados de la simulación del sistema real y una comparación con un escenario de mejora que presentó un aumento en la productividad.<strong></strong></p>

show abstract

Section: Trabajos Completadosunclassified

Análisis del proceso productivo de una empresa de confecciones: Modelación y simulación

Sánchez¹,

Ceballos

Torres

2015

Cien.Ing.Neogranadina

View full text Add to dashboard Cite

show abstract

“…The optimum objective function value (OFV) for the test problems is provided in the fourth column with its reference. Following columns provide the OFVs obtained by Samarghandi and Eshghi [33] and Solimanpur et al [23]. The last column states that BFA and CSA had generated optimum OFV for all twelve small-sized test problems.…”

Section: Assessing the Performance Of The Proposed Heuristicsmentioning

confidence: 99%

“…The first two columns state problem name and number of machines. Available OFVs and solution times from Amaral [31], Anjos and Vannelli [30], and Samarghandi and Eshghi [33] are given in Table 2. Table 3 provides the results obtained from BFA are given along with the number of best results among 10 replications, best, average, and worst OFV, standard deviation (Std.Dev.)…”

Section: Assessing the Performance Of The Proposed Heuristicsmentioning

confidence: 99%

“…Anjos et al [24] constructed a semidefinite programming relaxation providing a lower bound on the optimal value of the SRLP. Amaral et al [25] [32] proposed a GA. Samarghandi and Eshghi [33] considered the problem by an efficient tabu algorithm. The most recent paper of SRFLP is provided by Datta et al [34] that utilizes a permutation-based GA.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Assessing the Performance of Two Bioinspired Algorithms to Solve Single-Row Layout Problem

Ulutas

2013

International Journal of Manufacturing Engineering

View full text Add to dashboard Cite

The single-row layout problem (SRLP), also known as the one-dimensional layout problem, deals with arranging a number of rectangular machines/departments with equal or varying dimensions on a straight line. Since the problem is proved to be NP-hard, there are several heuristics developed to solve the problem. This study introduces both a Clonal Selection Algorithm (CSA) and a Bacterial Foraging Algorithm (BFA) for SRLP. The performance of the algorithms is assessed by using three (small, medium, and large sized) well known test problems available in the literature. The promising results illustrated that both algorithms had generated the best known solutions so far for most of the problems or provided better results for a number of problems.

show abstract

“…TS algorithm employs a Tabu mechanism to prevent searching over the neighborhood of repetitive solutions. In this regard, special specifications of newly produced solution is saved in a short-term memory, also known as tabu list (TL), and banned for the next  solutions (Samarghandi & Eshghi 2010). TS also exploits mechanisms such as diversification, intensification and aspiration.…”

Section: Ts-based Local Search Approachmentioning

confidence: 99%

A comprehensive quadratic assignment problem for an integrated layout design of final assembly line and manufacturing feeder cells

Rabbani¹,

Elahi²,

Javadi³

2017

10.5267/j.dsl

View full text Add to dashboard Cite

An efficient tabu algorithm for the single row facility layout problem

Cited by 105 publications

References 23 publications

Análisis del proceso productivo de una empresa de confecciones: Modelación y simulación

Análisis del proceso productivo de una empresa de confecciones: Modelación y simulación

Assessing the Performance of Two Bioinspired Algorithms to Solve Single-Row Layout Problem

A comprehensive quadratic assignment problem for an integrated layout design of final assembly line and manufacturing feeder cells

Contact Info

Product

Resources

About