برنامه تولید انعطاف پذیر برای نورد افقی

Previous studies on production planning indicated that keeping updated information on estimates of demand, estimates of production capacity, estimates of available resources, etc., during the planning horizon, is particularly important to maintain the current production planning. Hence, the planner has to change the production planning from time to time to accommodate these updating, and therefore, there is a huge waste of resource planning, since the production planning is carried out for the entire planning horizon, but only run for a few periods, or just one period. Another drawback of the existing arrangements to implement a rule of rolling-planning with the production planning is that they do not work well under capacity constraints and thus all the rolling-planning models that result from linear programming models coupled with clearing function are clearly outside the scope of these current schemes, since all of them incorporate capacity constraints. This paper comes providing a new scheme (Algorithm) to solve the pointed drawbacks, analyzes the scheme, prove a theorem which guarantees the result provided by the algorithm is correct, and finally illustrates the result using a numerical example.