A review of different approaches to the facility layout problems

SP Singh, RRK Sharma - The International Journal of Advanced …, 2006 - Springer
Here, an attempt is made to present a state-of-the-art review of papers on facility layout
problems. This paper aims to deal with the current and future trends of research on facility …

Next generation factory layouts: research challenges and recent progress

S Benjaafar, SS Heragu, SA Irani - Interfaces, 2002 - pubsonline.informs.org
Recent trends in industry suggest that existing layout configurations do not meet the needs
of multiproduct enterprises and that there is a need for a new generation of factory layouts …

A survey for the quadratic assignment problem

EM Loiola, NMM De Abreu… - European journal of …, 2007 - Elsevier
The quadratic assignment problem (QAP), one of the most difficult problems in the NP-hard
class, models many real-life problems in several areas such as facilities location, parallel …

Greedy randomized adaptive search procedures: Advances, hybridizations, and applications

MGC Resende, CC Ribeiro - Handbook of metaheuristics, 2010 - Springer
GRASP is a multi-start metaheuristic for combinatorial optimization problems, in which each
iteration consists basically of two phases: construction and local search. The construction …

Dynamic layout algorithms: a state-of-the-art survey

J Balakrishnan, CH Cheng - Omega, 1998 - Elsevier
It has been over a decade since Rosenblatt published his seminal paper on modelling the
dynamic facility layout problem (DFLP). Since then, there have been improvements to …

A review of intelligent approaches for designing dynamic and robust layouts in flexible manufacturing systems

G Moslemipour, TS Lee, D Rilling - The International Journal of Advanced …, 2012 - Springer
Facility layout problem is associated with the arrangement of facilities in a plant. It is a critical
issue in the early stages of designing a manufacturing system because it affects the total …

Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem

T Dunker, G Radons, E Westkämper - European Journal of Operational …, 2005 - Elsevier
This paper presents an algorithm combining dynamic programming and genetic search for
solving a dynamic facility layout problem. While the quadratic assignment formulation of this …

Greedy randomized adaptive search procedures: advances and extensions

MGC Resende, CC Ribeiro - Handbook of metaheuristics, 2019 - Springer
A greedy randomized adaptive search procedure (GRASP) is a multi-start metaheuristic for
combinatorial optimization problems, in which each iteration consists basically of two …

GRASP: Greedy randomized adaptive search procedures

MGC Resende, CC Ribeiro - … tutorials in optimization and decision support …, 2013 - Springer
GRASP is a multi-start metaheuristic for combinatorial optimization problems, in which each
iteration consists basically of two phases: construction and local search. The construction …

[HTML][HTML] Hospital layout design renovation as a Quadratic Assignment Problem with geodesic distances

C Cubukcuoglu, P Nourian, MF Tasgetiren… - Journal of Building …, 2021 - Elsevier
Hospital facilities are known as functionally complex buildings. There are usually
configurational problems that lead to inefficient transportation processes for patients …