Bi-objective facility expansion and relayout considering monuments

被引:22
作者
Kulturel-Konak, Sadan
Smith, Alice E.
Norman, Bryan A.
机构
[1] Penn State Berks, Management Informat Syst, Reading, PA 19610 USA
[2] Auburn Univ, Dept Ind & Syst Engn, Auburn, AL 36849 USA
[3] Univ Pittsburgh, Dept Ind Engn, Pittsburgh, PA 15261 USA
基金
美国国家科学基金会; 美国国家航空航天局;
关键词
bi-objective unequal-area facility re-layout problem; facility expansion; monuments; fixed departments; Pareto front; tabu search;
D O I
10.1080/07408170600805943
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In this paper, the unequal area facility expansion and relayout problem is studied. The facility relayout problem is important since both manufacturing and service entities must modify their layouts over time when their operational characteristics change. A bi-objective approach is proposed to solve the relayout problem for cases of both a fixed facility area and an expanded facility area. Material handling costs and relayout costs are minimized using a tabu search meta-heuristic optimizer. This heuristic randomly alternates the objective function between the two objectives of the problem in each step and, by doing so, eliminates the difficulty of weighting and scaling the two objectives. The approach is flexible in handling various aspects of the problem such as stationary portions of departments (i.e., monuments), addition of new departments, and changes in existing department and facility areas. Computational experiments show that the bi-objective tabu search approach is effective and tractable. The use of the Pareto front of designs is demonstrated by showing a few approaches to analyzing the trade-offs between initial costs (relayout cost) and ongoing expenses (material handling costs).
引用
收藏
页码:747 / 761
页数:15
相关论文
共 41 条
[1]  
[Anonymous], 1992, LECT NOTES ECON M, DOI DOI 10.1007/978-3-642-46768-4_5
[2]   A HEURISTIC ALGORITHM AND SIMULATION APPROACH TO RELATIVE LOCATION OF FACILITIES [J].
ARMOUR, GC ;
BUFFA, ES .
MANAGEMENT SCIENCE, 1963, 9 (02) :294-309
[3]   Dynamic layout algorithms: a state-of-the-art survey [J].
Balakrishnan, J ;
Cheng, CH .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 1998, 26 (04) :507-521
[4]   SOLUTIONS FOR THE CONSTRAINED DYNAMIC FACILITY LAYOUT PROBLEM [J].
BALAKRISHNAN, J ;
JACOBS, FR ;
VENKATARAMANAN, MA .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1992, 57 (02) :280-286
[5]   An improved pair-wise exchange heuristic for the dynamic plant layout problem [J].
Balakrishnan, J ;
Cheng, CH ;
Conway, DG .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2000, 38 (13) :3067-3077
[6]   Genetic search and the dynamic layout problem [J].
Balakrishnan, J ;
Cheng, CH .
COMPUTERS & OPERATIONS RESEARCH, 2000, 27 (06) :587-593
[7]   A simulated annealing algorithm for dynamic layout problem [J].
Baykasoglu, A ;
Gindy, NNZ .
COMPUTERS & OPERATIONS RESEARCH, 2001, 28 (14) :1403-1426
[8]   COMPUTERIZED LAYOUT DESIGN: A BRANCH AND BOUND APPROACH. [J].
Bazaraa, Mokhtar S. .
1975, 7 (04) :432-438
[9]   AN IMPROVEMENT-TYPE LAYOUT ALGORITHM FOR SINGLE AND MULTIPLE-FLOOR FACILITIES [J].
BOZER, YA ;
MELLER, RD ;
ERLEBACHER, SJ .
MANAGEMENT SCIENCE, 1994, 40 (07) :918-932
[10]  
Chiang WC, 2001, INT J PROD RES, V39, P1811, DOI 10.1080/0020754010035192