EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 55 (2021) Supplement RAIRO-Oper. Res., 55 (2021) S2433-S2453 References
Free Access
Issue
RAIRO-Oper. Res.
Volume 55, 2021
Regular articles published in advance of the transition of the journal to Subscribe to Open (S2O). Free supplement sponsored by the Fonds National pour la Science Ouverte
Page(s) S2433 - S2453
DOI https://doi.org/10.1051/ro/2020127
Published online 02 March 2021
  • P. Afentakis, R. Millen and M.M. Solomon, Dynamic layout strategies for flexible manufacturing systems. Int. J. Prod. Res. 28 (1990) 311–323. [Google Scholar]
  • J. Balakrishnan and C.H. Cheng, Dynamic layout algorithms: a State-of-the-art Survey. Omega 26 (1998) 507–521. [Google Scholar]
  • J. Balakrishnan and C.H. Cheng, Genetic search and the dynamic layout problem. Comput. Oper. Res. 27 (2000) 587–593. [Google Scholar]
  • J. Balakrishnan and C.H. Cheng, The dynamic plant layout problem: incorporating rolling horizons and forecast uncertainty. Omega 37 (2009) 165–177. [Google Scholar]
  • J. Balakrishnan, F.R. Jacobs and M.A. Venkataramanan, Solutions for the constrained dynamic facility layout problem. Eur. J. Oper. Res. 57 (1992) 280–286. [Google Scholar]
  • J. Balakrishnan, C.H. Cheng, D.G. Conway and C.M. Lau, A hybrid genetic algorithm for the dynamic plant layout problem. Int. J. Prod. Econ. 86 (2003) 107–120. [Google Scholar]
  • A. Baykasoğlu and N.N.Z. Gindy, A simulated annealing algorithm for dynamic layout problem. Comput. Oper. Res. 28 (2001) 1403–1426. [Google Scholar]
  • A. Baykasoğlu, T. Dereli and I. Sabuncu, An ant colony algorithm for solving budget constrained and unconstrained dynamic facility layout problems. Omega 34 (2006) 385–396. [Google Scholar]
  • L. Deyi and D. Yi, Artificial Intelligence with Uncertainty. Chapman & Hall/CRC, London (2005). [Google Scholar]
  • L. Deyi, M. Haijun and S. Xuemei, Membership clouds and membership cloud generators. J. Comput. Res. Dev. 32 (1995) 15–20. [Google Scholar]
  • K. Di, L. Deyi and L. Deren, Cloud theory and its applications in spatial data mining knowledge discovery. J. Image Graph 4 (1999) 930–935. [Google Scholar]
  • A. Drira, H. Pierreval and H. Hajri-Gabouj, Facility layout problems: a survey. Ann. Rev. Control 31 (2007) 255–267. [Google Scholar]
  • E. Erel, J.B. Ghosh and J.T. Simon, New heuristic for the dynamic layout problem. J. Oper. Res. Soc. 54 (2003) 1275–1282. [Google Scholar]
  • M. Horta, F. Coelho and S. Relvas, Layout design modelling for a real world just-in-time warehouse. Comput. Ind. Eng. 101 (2016) 1–9. [Google Scholar]
  • S.S. Hosseini and M. Seifbarghy, A novel meta-heuristic algorithm for multi-objective dynamic facility layout problem, RAIRO:OR 50 (2016) 869–890. [Google Scholar]
  • S. Hosseini, A. Al Khaled and S. Vadlamani, Hybrid imperialist competitive algorithm, variable neighborhood search, and simulated annealing for dynamic facility layout problem. Neural Comput. App. 25 (2014) 1871–1885. [Google Scholar]
  • M. Hu, A high-fidelity three-dimensional simulation method for evaluating passenger flow organization and facility layout at metro stations. Simulation 93 (2017) 841–851. [Google Scholar]
  • B.K. Kaku and J.B. Mazzola, A tabu-search heuristic for the dynamic plant layout problem. Informs J. Comput. 9 (1997) 374–384. [Google Scholar]
  • M. Kaveh, V. Majazi Dalfard and S. Amiri, A new intelligent algorithm for dynamic facility layout problem in state of fuzzy constraints. Neural Comput. App. 24 (2014) 1179–1190. [Google Scholar]
  • K.K. Krishnan, S.H. Cheraghi and C.N. Nayak, Dynamic From-Between Chart: a new tool for solving dynamic facility layout problems. Int. J. Ind. Syst. Eng. 1 (2006) 182–200. [Google Scholar]
  • T.A. Lacksonen and E.E. Enscore, Quadratic assignment algorithms for the dynamic layout problem. Int. J. Prd. Res. 31 (1993) 503–517. [Google Scholar]
  • J. Liu, W. Dawen, H. Kun and X. Yu, Combining Wang–Landau sampling algorithm and heuristics for solving the unequal-area dynamic facility layout problem. Eur. J. Oper. Res. 262 (2017) 1052–1063. [Google Scholar]
  • P. Lv, L. Yuan and J. Zhang, Cloud theory-based simulated annealing algorithm and application. Eng. Appl. Artif. Intell. 22 (2009) 742–749. [Google Scholar]
  • A.R. McKendall Jr and W.H. Liu, New Tabu search heuristics for the dynamic facility layout problem. Int. J. Prod. Res. 50 (2012) 867–878. [Google Scholar]
  • A.R. McKendall Jr and J. Shang, Hybrid ant systems for the dynamic facility layout problem. Comput. Oper. Res. 33 (2006) 790–803. [Google Scholar]
  • A.R. McKendall Jr, J. Shang and S. Kuppusamy, Simulated annealing heuristics for the dynamic facility layout problem. Comput. Oper. Res. 33 (2006) 2431–2444. [Google Scholar]
  • G. Moslemipour, T.S. Lee and D. Rilling, A review of intelligent approaches for designing dynamic and robust layouts in flexible manufacturing systems. Int. J. Adv. Manuf. Technol. 60 (2012) 11–27. [Google Scholar]
  • J.A. Qudeiri, U. Umer, F.A. Khadra, H.M.A. Hussein, A. Al-Ahmari, S. Darwish and M.H. Abidi, Layout design optimization of dynamic environment flexible manufacturing systems. Adv. Mech. Eng. 7 (2015) 1–11. [Google Scholar]
  • H. Rezazadeh, M. Ghazanfari, M. Saidi-Mehrabad and S.J. Sadjadi, An extended discrete particle swarm optimization algorithm for the dynamic facility layout problem. J. Zhejiang Univ. Sci. A 10 (2009) 520–529. [Google Scholar]
  • J.M. Rodriguez, F.C. MacPhee, D.J. Bonham and V.C. Bhavsar, Solving the dynamic plant layout problem using a new hybrid meta-heuristic algorithm. Int. J. High Perform Comput. Networking 4 (2006) 286–294. [Google Scholar]
  • M.J. Rosenblatt, The dynamics of plant layout. Manage. Sci. 32 (1986) 76–86. [Google Scholar]
  • R. Şahin and O. Türkbey, A new hybrid tabu-simulated annealing heuristic for the dynamic facility layout problem. Int. J. Prod. Res. 47 (2009) 6855–6873. [Google Scholar]
  • R. Şahin, K. Ertoğral and O. Türkbey, A simulated annealing heuristic for the dynamic facility layout problem with budget constraint. Comput. Ind. Eng. 59 (2010) 308–313. [Google Scholar]
  • R. Sharpe and B.S. Marksjö, Facility layout optimization using the metropolis algorithm. Environ. Plann B 12 (1985) 443–453. [Google Scholar]
  • S.P. Singh and R.R.K. Sharma, A review of different approaches to the facility layout problems. Int. J. Adv. Manuf. Technol. 30 (2006) 425–433. [Google Scholar]
  • J.A. Tompkins, J.A. White, Y.A. Bozer and J.M.A. Tanchoco, Facilities Planning. John Wiley & Sons, New York (2003). [Google Scholar]
  • B.H. Ulutas and A.A. Islier, A clonal selection algorithm for dynamic facility layout problems. J. Manuf. Syst. 28 (2009) 123–131. [Google Scholar]
  • T.L. Urban, A heuristic for the dynamic facility layout problem. IIE Trans. 25 (1993) 57–63. [Google Scholar]
  • S. Vitayasak, P. Pongcharoen and C. Hicks, A tool for solving stochastic dynamic facility layout problems with stochastic demand using either a Genetic Algorithm or modified Backtracking Search Algorithm. Int. J. Prod. Econ. 190 (2017) 146–157. [Google Scholar]
  • J. Witte, The use of similarity coefficients in production flow analysis. Int. J. Prod. Res. 18 (1980) 503–514. [Google Scholar]
  • L. Yao, L. Sun, W. Wang and X. Xia, Connection facility layout model of subway stations. Adv. Mech. Eng. 7 (2015) 457508. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.