A perfect forward procedure for a single facility dynamic location/relocation problem
From MaRDI portal
Publication:1200755
DOI10.1016/0167-6377(92)90016-VzbMath0757.90045OpenAlexW2018182425MaRDI QIDQ1200755
Publication date: 16 January 1993
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(92)90016-v
forecast horizoninfinite horizon planningforward proceduresingle facility dynamic location/relocation problemdynamic lot size problemspolicy trees
Related Items
A note on ``A perfect forward procedure for a single facility dynamic location/relocation problem, Computing minimal forecast horizons: an integer programming approach, Locations on time-varying networks, A computational comparison of several formulations for the multi-period incremental service facility location problem, Dynamic location of modular manufacturing facilities with relocation of individual modules, Single facility location and relocation problem with time dependent weights and discrete planning horizon
Cites Work
- Lot-trees: A unifying view and efficient implementation of forward procedures for the dynamic lot-size problem
- Decision/forecast horizon results for a single facility dynamic location/relocation problem
- Minimal forecast horizon procedures for dynamic lot size models
- A perfect lot-tree procedure for the discounted dynamic lot-size problem with speculation
