The aim of this paper is to present a heuristic expressly developed for facility layout problems. In particular, a linear single-row machine layout is considered, one of the most implemented schemes in FMSs. The model requires each of n unique machines to be assigned to one of n locations along a linear track in such a way that the total distance travelled by the material handling device is minimised. We assume that machine locations and facilities are equally-spaced. To evaluate the performance, the algorithm is compared with two known procedures developed in the past for equivalent problems and with two iterative methods based on two different neighbourhood search schemes. It is shown that the new algorithm gives good results in every case.
A heuristic for one-dimensional facility location problems in flexible manufacturing systems
BRAGLIA, MARCELLO;
1996-01-01
Abstract
The aim of this paper is to present a heuristic expressly developed for facility layout problems. In particular, a linear single-row machine layout is considered, one of the most implemented schemes in FMSs. The model requires each of n unique machines to be assigned to one of n locations along a linear track in such a way that the total distance travelled by the material handling device is minimised. We assume that machine locations and facilities are equally-spaced. To evaluate the performance, the algorithm is compared with two known procedures developed in the past for equivalent problems and with two iterative methods based on two different neighbourhood search schemes. It is shown that the new algorithm gives good results in every case.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.