Preprocessing for static and dynamic facility layout problems

Abstract

Most facility layout problems have departments with unequal areas and have signi® cant rearrangement costs. This paper describes a model and improved algorithm which simultaneously handles these parameters. An existing algorithm solves the dynamic facilities layout problem while permitting the departments to have unequal areas. One part of the algorithm solves a mixed integer programming problem to ® nd the desired block diagram layout. This large, complex problem could only be solved optimally for small problems. Therefore a preprocessing method was developed to prespecify certain obviou s department pair orientations, which had previously required binary variables. The method uses estimated location, department sizes, and¯ow costs to determine the probable variable values. Then, a revised branch and boun d strategy solves for the less obvious department pair orientations. Test results show a signi® cant cost reduction on a variety of previously published problems, and feasible solutions to previously unsolved problems. The algorithm found a layout solution to the standard CR AF T problem which has 10 . 5% lower costs than the previously best published layout.

A simulated annealing algorithm for unequal area dynamic facility layout problems with flexible bay structure

“…The hardware used for the proposed SA heuristic algorithm is Windows PC with Intel(R) core(TM) i5-4570, 3.2GHz, 8GB RAM. The pre-processing and branch and bound strategy of Lacksonen (1997) is tested on Sun SparcStation 2 with a Weitek board and 64Mb RAM. The GA and dynamic programming of Dunker et al (2005) is tested on Pentium IV 1.5 GHz PC, and boundary search and tabu search heuristics of McKendall and Hakobyan (2010) is tested on Pentium IV 3.6 GHz PC.…”

“…Kulturel- Konak and Konak (2015) gave the P15 problem for the UA-DFLPs literature which has 15-facility with 3-period in the planning horizon. Test problems DFLP-12-3, DFLP-12-5 and DFLP-20-3 are from Lacksonen (1997). Problems DFLP-12-3 and DFLP-12-5 have 12-facility with 3 and 5 periods in the planning horizon respectively and DFLP-20-3 has 20-facility with 3 periods in the planning horizon.…”

“…The objective is the minimization of total material handling cost of the planning horizon by considering the trade-off between facilities rearrangement cost and material flow cost. Lacksonen (1997) presented an MILP model using two-stage solution method. In Stage 1, the model is solved with the consideration of equal area facilities and in this stage, the relative positions of the facilities are obtained.…”

“…Lacksonen (1997) uses pre-processing and branch and bound strategy to solve aspect ratio constraint problems DFLP-12-3, DFLP-12-5 and DFLP-20-3. Researchers (Dunker et al, 2005;McKendall & Hakobyan, 2010;Derakhshan Asl & Wong 2017) used various meta-heuristics like combined GA and dynamic programming, boundary search and tabu search heuristics, and particle swarm optimization to solve fixed shape facilities problem of P6 and P12.…”

El WIP como objetivo estratégico en la distribución de planta

“…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...…”