The dynamic plant layout problem: Incorporating rolling horizons and forecast uncertainty

被引:41
作者
Balakrishnan, Jaydeep [1 ]
Cheng, Chun Hung [2 ]
机构
[1] Univ Calgary, Operat Management Area, Haskayne Sch Business, Calgary, AB T2N 1N4, Canada
[2] Chinese Univ Hong Kong, Dept Syst Engn & Engn Management, Shatin, Hong Kong, Peoples R China
来源
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE | 2009年 / 37卷 / 01期
关键词
dynamic plant layout; heuristics; pairwise exchange; rolling horizons; forecast uncertainty; LOT SIZE MODEL; FACILITY LAYOUT; ALGORITHM;
D O I
10.1016/j.omega.2006.11.005
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
To the best of our knowledge, research in the dynamic plant layout problem (DPLP) assumes that the planning horizon is fixed and that material flows are known with certainty. But in practice, many companies use rolling planning horizons. Further, they have to deal with the effect of uncertainty in material flow forecasts. This paper investigates the performance of algorithms under fixed and rolling horizons, under different shifting costs and flow variability, and under forecast uncertainty. Nearly 1800 problems were run using different algorithms. The results show that algorithms that dominated under fixed horizons may not work as well under rolling horizons. Also it is difficult to identify an algorithm that performs well under all situations. Thus the development of efficient and effective heuristics might be useful in solving the rolling horizon problem. It also appears that increasing the planning horizon under rolling plans does not offer any advantage. Further forecast uncertainty may not significantly affect the performance of algorithms and in some cases may be beneficial. (C) 2006 Elsevier Ltd. All rights reserved.
引用
收藏
页码:165 / 177
页数:13
相关论文
共 41 条
[1]   More-for-less algorithm for fixed-charge transportation problems [J].
Adlakha, Veena ;
Kowalski, Krzysztof ;
Vemuganti, R. R. ;
Lev, Benjamin .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2007, 35 (01) :116-127
[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]  
Baker KR., 1977, DECISION SCI, V8, P19, DOI [10.1111/j.1540-5915.1977.tb01065.x, DOI 10.1111/J.1540-5915.1977.TB01065.X]
[4]   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
[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]   A hybrid genetic algorithm for the dynamic plant layout problem [J].
Balakrishnan, JD ;
Cheng, CH ;
Conway, DG ;
Lau, CM .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2003, 86 (02) :107-120
[7]   An ant colony algorithm for solving budget constrained and unconstrained dynamic facility layout problems [J].
Baykasoglu, A ;
Dereli, T ;
Sabuncu, I .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2006, 34 (04) :385-396
[8]   Erratum to "A simulated annealing algorithm for dynamic layout problem" (vol 28, pg 1367, 2001) [J].
Baykasoglu, A ;
Gindy, NNZ .
COMPUTERS & OPERATIONS RESEARCH, 2004, 31 (02) :313-315
[9]   A simulated annealing algorithm for dynamic layout problem [J].
Baykasoglu, A ;
Gindy, NNZ .
COMPUTERS & OPERATIONS RESEARCH, 2001, 28 (14) :1403-1426
[10]  
BRIEC W, 2006, OMEGA IN PRESS