2006
DOI: 10.1016/j.cor.2005.02.021
|View full text |Cite
|
Sign up to set email alerts
|

Simulated annealing heuristics for the dynamic facility layout problem

Abstract: Today's consumer market demands that manufacturers must be competitive. This requires the efficient operation of manufacturing plants and their ability to quickly respond to changes in product mix and demand. Studies show that material handling cost makes up between 20 and 50 percent of the total operating cost. Therefore, this thesis considers the problem of arranging and rearranging (when there are changes in product mix and demand) manufacturing facilities such that material handling and rearrangement costs… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
58
0
4

Year Published

2010
2010
2023
2023

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 163 publications
(66 citation statements)
references
References 74 publications
(138 reference statements)
0
58
0
4
Order By: Relevance
“…En los objetivos cualitativos se encuentran la seguridad de la planta, la flexibilidad de la distribución, el ruido y la estética (Singh & Sharma, 2006). El objetivo más usado para encontrar la distribución óptima es minimizar el costo de manejo de materiales (McKendall, Shang, & Kuppusamy, 2006;Meller & KaiYin, 1996). En los últimos años se ha incluido un criterio diferente que considera otras medidas de rendimiento operativo, como el inventario de trabajo en proceso (WIP) o el tiempo de ciclo (LT).…”
Section: Introductionunclassified
See 1 more Smart Citation
“…En los objetivos cualitativos se encuentran la seguridad de la planta, la flexibilidad de la distribución, el ruido y la estética (Singh & Sharma, 2006). El objetivo más usado para encontrar la distribución óptima es minimizar el costo de manejo de materiales (McKendall, Shang, & Kuppusamy, 2006;Meller & KaiYin, 1996). En los últimos años se ha incluido un criterio diferente que considera otras medidas de rendimiento operativo, como el inventario de trabajo en proceso (WIP) o el tiempo de ciclo (LT).…”
Section: Introductionunclassified
“…Un nivel de WIP demasiado alto alarga los tiempos de ciclo y puede disminuir el rendimiento de entregas a tiempo, lo 1 (Abedzadeh, Mazinani, Moradinasab, & Roghanian, 2012;Aderoba, 1997;Balakrishan, 1998;Balakrishan & Cheng, 2009;Balakrishan & Cheng, 2005;Balakrishan, Cheng, & Conway, 2000;Baykasoglu & Gindy, 2001;Benjaafar, 1998;Braglia, Zanoni, & Zavanella, 2005;Chen M. , 1998;Chen G. Y., 2007;Chen, Chen, & Chuang, 2011;Corry & Kozan, 2004;da Silva, Bahiense, Ochi, & Boaventura-Netto, 2012;Dong, Wu, & Hou, 2009;Dunker, Radons, & Westkamper, 2005;El-Rayes & Said, 2009;Erel, Ghosh, & Simon, 2003;Fu & Kaku, 1997;Jaramillo & McKendall Jr., 2010;Jaramillo & McKendall Jr., 2004;Jithavech & Krishnan, 2010;Jolai, Taghipour, & Javadi, 2011;Kia, 2011;Krishnan, Jithavech, & Liao, 2009;Krishnan, Cheragi, & Nayak, 2008;Kulturel-Konak, 2007;Kulturel-Konak, Smith, & Norman, 2007;Lacksonen, 1997;Lacksonen & Enscore, 1993;Ma & Zhang, 2010;Mazinani, Abedzadeh, & Mohebali, 2012;McKendall Jr. & Hakobyan, 2010;McKendall Jr., Shang, & Kuppusamy, 2006;Meng, Heragu, & Zijm, 2004;Moslemipour & Lee, 2011;P...…”
Section: Antecedentesmentioning
confidence: 99%
“…Simulated annealing has been applied successfully to a wide variety of highly complicated combinatorial optimization problems [18][19][20][21]. It was successfully applied to the TTRP by Yu et al [14].…”
Section: Simulated Annealing Heuristic For the Rttrpmentioning
confidence: 99%
“…The dynamic environment QAP is still more complex than static QAP due to an introduction of periods in the dynamic QAP. Hence researchers use different meta-heuristic methods to solve equal area DFLPs (Conway & Venkataramanan, 1994;Balakrishnan & Cheng, 2000;Baykasoglu & Gindy, 2001;Balakrishnan et al, 2003;McKendall et al, 2006;Yang et al, 2011;Pourvaziri & Naderi, 2014;Bozorgi et al, 2015). Pillai et al (2011) and Forghani et al (2013) used the robust approach to solve equal area DFLPs.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Unlike other metaheuristics, SA is simple to implement, and it is sequential search algorithm hence it is computationally more efficient one. Application of SA is made for solving equal area static and dynamic facility layout problems (Whim & Ward, 1987;Baykasoglu & Gindy, 2001;McKendall Jr et al, 2006;Pillai et al, 2011). Tam (1992) used SA for general type UA-FLPs but not for UA-DFLP with FBS.…”
Section: Literature Reviewmentioning
confidence: 99%