Planning Horizons for the Dynamic Lot Size Model: Zabel vs. Protective Procedures and Computational Results
From MaRDI portal
Publication:4079305
DOI10.1287/opre.23.4.711zbMath0317.90028OpenAlexW2168795829MaRDI QIDQ4079305
Thomas E. Morton, Rolf A. Lundin
Publication date: 1975
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.23.4.711
Related Items (36)
An effective algorithm for the capacitated single item lot size problem ⋮ Capacity expansion with alternative technology choices ⋮ Planning horizons for capacity expansion ⋮ Error bound for the dynamic lot size model with backlogging ⋮ Computing minimal forecast horizons: an integer programming approach ⋮ Decision/forecast horizon results for a single facility dynamic location/relocation problem ⋮ Minimizing the error bound for the dynamic lot size model ⋮ Planning horizons for multi-item hierarchical production scheduling problems: A heuristic search procedure ⋮ A forward algorithm and planning horizon procedure for the production smoothing problem without inventory ⋮ Eyeballing heuristics for dynamic lot sizing problems with rolling horizons ⋮ Degeneracy in infinite horizon optimization ⋮ Dynamic lot-sizing model under perishability, substitution, and limited storage capacity ⋮ Forecast horizon of dynamic lot size model for perishable inventory with minimum order quantities ⋮ Lot-trees: A unifying view and efficient implementation of forward procedures for the dynamic lot-size problem ⋮ Planning horizons for manpower planning. A theoretical analysis ⋮ A survey of dynamic network flows ⋮ Master production schedule time interval strategies in make-to-order supply chains¶ ⋮ Remanufacturing planning for the reverse Wagner/Whitin models ⋮ A concave cost stochastic replacement problem. ⋮ A concave cost multimachine replacement problem with an expected breakthrough. ⋮ Comparative study of dynamic lot sizing heuristics with backlogging ⋮ Forecast horizon for dynamic lot sizing model under product substitution and perishable inventories ⋮ Selection, acquisition, and allocation of manufacturing technology in a multi-period environment ⋮ Dynamic lot-sizing model with demand time windows and speculative cost structure ⋮ A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints ⋮ Decision horizons in multistage dynamical lot size planning. ⋮ Decision and forecast horizons in a stochastic environment: A survey ⋮ A forward branch-and-search algorithm and forecast horizon results for the changeover scheduling problem ⋮ Exact and heuristic algorithms for data sets reconstruction ⋮ A multi-period profit maximizing model for retail supply chain management: An integration of demand and supply-side mechanisms ⋮ Single item lot sizing problems ⋮ A novel decomposition approach for on-line lot-sizing. ⋮ Dynamic lot-sizing with price changes and price-dependent holding costs ⋮ Inventory planning in a deterministic environment: Continuous time model with concave costs ⋮ A dynamic production planning and scheduling algorithm for two products processed on one line ⋮ Sensitivity analysis of the economic lot-sizing problem
This page was built for publication: Planning Horizons for the Dynamic Lot Size Model: Zabel vs. Protective Procedures and Computational Results
