search query: @indexterm dynamic models / total: 269
reference: 118 / 269
| Author: | Shulman, A. |
| Title: | An algorithm for solving dynamic capacitated plant location problems with discrete expansion sizes |
| Journal: | Operations Research
1991 : MAY-JUN, VOL. 39:3, p. 423-437 |
| Index terms: | PLANT LOCATION DYNAMIC MODELS ALGORITHMS OPTIMIZATION TRANSPORT COSTS |
| Language: | eng |
| Abstract: | In the dynamic plant location problems, the task is to select the time schedule for installing facilities at different locations to minimize the total discounted costs for meeting customer demands specified over the period of time called the planning horizon. The costs include setup costs for establishing facilities, volume dependent operational costs, and transportation costs for distributing demand from facilities to customers. A class of the problems is considered, in which the available facilities have finite capacities. The problem is formulated as a combinatorial optimization problem that allows consideration of more than one facility type and finds the optimum mix of facilities in each location. |
SCIMA