论文信息 - A perfect forward procedure for a single facility dynamic location/relocation problem

A perfect forward procedure for a single facility dynamic location/relocation problem

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.

M Bastian | M Volkmer | M. Volkmer | M. Bastian

[1] Michael Bastian. A perfect lot-tree procedure for the discounted dynamic lot-size problem with speculation , 1992 .

[2] Suresh Chand,et al. Minimal forecast horizon procedures for dynamic lot size models , 1986 .

[3] Suresh Chand. Decision/forecast horizon for a single facility dynamic location/relocation problem , 1988 .

[4] Michael Bastian. Lot-trees: A unifying view and efficient implementation of forward procedures for the dynamic lot-size problem , 1990, Comput. Oper. Res..