A PERFECT FORWARD PROCEDURE FOR A SINGLE FACILITY DYNAMIC LOCATION RELOCATION PROBLEM

被引:14
作者
BASTIAN, M [1 ]
VOLKMER, M [1 ]
机构
[1] RHEIN WESTFAL TH AACHEN,LEHRSTUHL WIRTSCHAFTSINFORMAT,W-5100 AACHEN,GERMANY
关键词
FORECAST HORIZONS; LOCATION RELOCATION; PERFECT ALGORITHMS; POLICY TREES;
D O I
10.1016/0167-6377(92)90016-V
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
A perfect forward procedure is proposed that determines the optimal initial decision of the single facility dynamic location/relocation problem by only using information from the smallest forecast horizon. The fixed cost of relocating the facility may depend on the period as well as on the locations. The algorithm uses the data structure of a policy tree which is adapted from the lot tree approach for solving dynamic lot size problems.
引用
收藏
页码:11 / 16
页数:6
相关论文
共 4 条
[1]  
BASTIAN M, 1992, NAVAL RES LOGIS, V39
[2]  
BASTIAN M, 1990, COMPUT ORP RES, V17, P225
[3]   DECISION FORECAST HORIZON RESULTS FOR A SINGLE FACILITY DYNAMIC LOCATION RELOCATION PROBLEM [J].
CHAND, S .
OPERATIONS RESEARCH LETTERS, 1988, 7 (05) :247-251
[4]   MINIMAL FORECAST HORIZON PROCEDURES FOR DYNAMIC LOT SIZE MODELS [J].
CHAND, S ;
MORTON, TE .
NAVAL RESEARCH LOGISTICS, 1986, 33 (01) :111-122