论文信息 - A forward algorithm and planning horizon procedure for the production smoothing problem without inventory

A forward algorithm and planning horizon procedure for the production smoothing problem without inventory

Abstract We develop a forward algorithm for solving and finding planning horizons for the infinite horizon version of the deterministic production smoothing problem without inventory. This model approximates the real world situation for highly obsolescent or perishable commodities such as newspapers and fresh produce. Computational results show that the algorithm is linear in problem length while linear programming is at least quadratic.

[1] Harvey M. Wagner,et al. Optimal Production Scheduling and Employment Smoothing with Deterministic Demands , 1967 .

[2] T. Morton,et al. General Planning Horizons for Production Smoothing with Deterministic Demands , 1974 .

[3] 飯原慶雄. Smoothed Production Plans , 1960 .

[4] Howard Kunreuther,et al. Planning Horizons for Production Smoothing with Deterministic Demands: I. All Demand Met from Regular Production , 1973 .

[5] A. Charnes,et al. Decision and horizon rules for stochastic planning problems : a linear example , 1966 .

[6] W. Jacobs,et al. Smooth Patterns of Production , 1954 .

[7] M. Beckmann. Production Smoothing and Inventory Control , 1961 .

[8] Edward A. Silver,et al. A Tutorial on Production Smoothing and Work Force Balancing , 1967, Oper. Res..

[9] G. Nemhauser,et al. Integer Programming , 2020 .

[10] C. C. Holt,et al. Planning Production, Inventories, and Work Force. , 1962 .

[11] Rolf A. Lundin,et al. Planning Horizons for the Dynamic Lot Size Model: Zabel vs. Protective Procedures and Computational Results , 1975, Oper. Res..

[12] Sidney W. Hess,et al. A Linear Programming Approach to Production and Employment Scheduling , 1960 .

[13] Thomas E. Morton,et al. Infinite-Horizon Dynamic Programming Models - A Planning-Horizon Formulation , 1979, Oper. Res..

[14] M. Klein. On Production Smoothing , 1961 .