Many existing algorithms for facility layout problems give block layouts in
which departments have irregular shapes. This paper presents algorithms to
modify shapes of departments in a given block layout with such departments
. With the suggested algorithms, a given block layout is converted into a n
ew block layout in which departments are of rectangular shapes without a si
gnificant change in the relative positions of the departments. Results of c
omputational experiments show that the suggested algorithms give block layo
uts that are at least as good as original layouts in terms of the total tra
nsportation distance. (C) 2000 Elsevier Science Ltd. All rights reserved.