Strong turnpike policies in the single-item capacitated lot-sizing problem with periodical dynamic parameter

Naval Research Logistics

Volumn 44, Issue 8, 1997, Pages 775-790

  Bylka, Stanislaw ^a  

^a INSTITUTE OF COMPUTER SCIENCE   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COSTS; INDUSTRIAL ECONOMICS; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; RANDOM PROCESSES;

BACKLOGGING COSTS; INVERSE POLICY; LOT SIZING PROBLEM; TURNPIKE POLICY;

PRODUCTION ENGINEERING;

EID: 0031378413     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6750(199712)44:8<775::AID-NAV5>3.0.CO;2-7     Document Type: Article

References (15)

1. Banerijee, A., and Burton, J.S., "Coordinated vs. Independent Inventory Replenishment Policies for a Vendor and Multiple Buyers," International Journal of Production Economics, 35, 215-222 (1994).
2. Bensoussan, A., Proth, J.M., and Queyranne, M., "A Planning Horizon Algorithm for Deterministic Inventory Management with Picewise Linear Concave Costs," Naval Research Logistics, 38, 729-742 (1991).
3. Bylka, S., and Sethi, S., "Existence and Derivation of Forecast Horizons in a Dynamic Lot Size Models with Nondecreasing Holding Costs," Production and Operations Management, 1(2), 212-223 (1992).
4. Bylka, S., "Algorithm for Turnpike Policies in Dynamic Lot Size Model," Applicationes Mathematicae, 24(1), 57-75 (1996).
5. Chand, S., and Morton, T.E., "Minimal Forecast Horizon Procedures for Dynamic Lot-Size Model," Naval Research Logistics Quarterly, 33, 111-122 (1986).
6. Chand, S., Sethi, S.P., and Proth, J.M., "Existence of Forecast Horizons in Undisconted Discrete Time Lot-Size Model," Operations Research, 38, 884-892 (1990).
7. Federgruen, A., and Tzur, M., "The Dynamic Lot-Sizing Model with Backlogging: A Simple O(n log n) Algorithm and Minimal Forecast Horizon Procedure," Naval Research Logistics, 40, 459-478 (1993).
8. Hinderer, K., and Hübner, G., "An Improvement of J.F. Shapiro's Turnpike Theorem for the Horizon of Finite Stage Discrete Dynamic Programs," in Transactions of the Seventh Prague Conference on Information Theory 1974, Acad. Publ. House, Prague, 1977, Vol. A, pp. 245-255.
9. Lee, C.Y., and Denardo, E.V., "Rolling Planning Horizons: Error Bounds for the Dynamic Lot-Size Model," Mathematics of Operations Research, 11, 423-432 (1986).
10. Los, J., "Horizons in Dynamic Programs," in Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, California University Press, Berkeley, 1967, pp. 479-490.
11. Lotfi, V., and Yoon, Y.-S., "An Algorithm for the Single-item Capacitated Lot Size Model with Concave Production and Holding Costs," Journal of Operational Research Society, 45, 934-941 (1994).
12. Pochet, Y., and Wolsey, L.A., "Algorithms and Reformulations for Lot Sizing Problems," in DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1995, Vol. 20, 245-293.
13. Ryan, S.M., Bean, J.C., and Smith, L., "A Tie-Breaking Rule for Discrete Infinite Horizon Optimization," Operations Research, 40 (Suppl. 2), S117-S126 (1992).
14. Sandbothe, R.A., and Thompson, G.L., "A Forward Algorithm for the Capacitated Lot Size Model with Stockouts," Operations Research, 38(3), 474-486 (1990).
15. Zheng, Y.-S., and Chen, F., "Inventory Policies with Quantized Ordering," Naval Research Logistics, 39, 285-305 (1992).