On the public citation graph
Forecast Horizons in the Discounted Dynamic Lot Size Model
0 signed · 35 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/1520-6750(198712)34:6<761::aid-nav3220340602>3.0.co;2-xopenalex-snapshot
Forecast horizons for the discounted dynamic lot-size problem allowing speculative motive
inferredcites →https://doi.org/10.1016/0305-0548(81)90009-5openalex-snapshot
Planning horizons for the deterministic capacity problem
inferredcites →https://doi.org/10.1016/0377-2217(82)90108-4openalex-snapshot
Lot sizing for products with finite demand horizon and periodic review inventory policy
inferredcites →https://doi.org/10.1287/mnsc.1040.0262openalex-snapshot
Dynamic Version of the Economic Lot Size Model
inferredcites →https://doi.org/10.1287/moor.13.2.295openalex-snapshot
Concepts of Forecast and Decision Horizons: Applications to Dynamic Stochastic Optimization Problems
inferredcites →https://doi.org/10.1287/moor.9.3.391openalex-snapshot
Conditions for the Existence of Planning Horizons
inferredcites →https://doi.org/10.1287/opre.14.6.1045openalex-snapshot
The Theory and Computation of Knapsack Functions
inferredcites →https://doi.org/10.1287/opre.15.2.319openalex-snapshot
A Finite Renewal Algorithm for the Knapsack and Turnpike Models
inferredcites →https://doi.org/10.1287/opre.23.4.711openalex-snapshot
Planning Horizons for the Dynamic Lot Size Model: Zabel vs. Protective Procedures and Computational Results
inferredcites →https://doi.org/10.1287/opre.38.5.884openalex-snapshot
Existence of Forecast Horizons in Undiscounted Discrete-Time Lot Size Models
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.2208696openalex-extracted
Multi-Period Lot-Sizing with Stationary Demand: Extension to Forecast Horizons
inferred← citeshttps://doi.org/10.1002/1520-6750(199306)40:4<459::aid-nav3220400404>3.0.co;2-8openalex-snapshot
The dynamic lot-sizing model with backlogging: A simpleo(n logn) algorithm and minimal forecast horizon procedure
inferred← citeshttps://doi.org/10.1002/1520-6750(199412)41:7<1019::aid-nav3220410712>3.0.co;2-sopenalex-snapshot
Suboptimality of equal lot sizes for finite-horizon problems
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0403openalex-snapshot
Infinite Horizon Problems
inferred← citeshttps://doi.org/10.1007/0-387-33815-2openalex-snapshot
Stochastic processes, optimization, and control theory : applications in financial engineering, queueing networks, and manufacturing systems : a volume in honor of Suresh Sethi
inferred← citeshttps://doi.org/10.1007/978-1-4614-7639-9_2openalex-snapshot
Multi-Period Lot-Sizing with Stationary Demand: Extension to Forecast Horizons
inferred← citeshttps://doi.org/10.1007/s00291-019-00552-1openalex-snapshot
Model formulations for the capacitated lot-sizing problem with service-level constraints
inferred← citeshttps://doi.org/10.1016/0167-6377(94)00063-copenalex-snapshot
Minimizing the error bound for the dynamic lot size model
inferred← citeshttps://doi.org/10.1016/j.automatica.2006.04.016openalex-snapshot
Boundary value problems in stochastic optimal control of advertising
inferred← citeshttps://doi.org/10.1016/j.omega.2006.11.005openalex-snapshot
The dynamic plant layout problem: Incorporating rolling horizons and forecast uncertainty☆
inferred← citeshttps://doi.org/10.1080/00207540600902262openalex-snapshot
Modeling industrial lot sizing problems: a review
inferred← citeshttps://doi.org/10.1108/17465660710763443openalex-snapshot
The development of planning horizon theory and the comparison of decision/forecast horizons for dynamic lot size models
inferred← citeshttps://doi.org/10.1111/j.1475-3995.2009.00747.xopenalex-snapshot
Discrete–continuous analysis of optimal equipment replacement
inferred← citeshttps://doi.org/10.1111/j.1937-5956.1992.tb00353.xopenalex-snapshot
EXISTENCE AND DERIVATION OF FORECAST HORIZONS IN A DYNAMIC LOT SIZE MODEL WITH NONDECREASING HOLDING COSTS
inferred← citeshttps://doi.org/10.1111/poms.12757openalex-snapshot
Stabilized‐Cycle Strategy for Capacitated Lot Sizing with Multiple Products: Fill‐Rate Constraints in Rolling Schedules
inferred← citeshttps://doi.org/10.1287/mnsc.37.8.909openalex-snapshot
A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
inferred← citeshttps://doi.org/10.1287/mnsc.42.12.1732openalex-snapshot
Learning in Setups: Analysis, Minimal Forecast Horizons, and Algorithms
inferred← citeshttps://doi.org/10.1287/mnsc.44.9.1313openalex-snapshot
Infinite Horizon Production Planning in Time-Varying Systems with Convex Production and Inventory Costs
inferred← citeshttps://doi.org/10.1287/mnsc.46.2.318.11924openalex-snapshot
Improved Rolling Schedules for the Dynamic Single-Level Lot-Sizing Problem
inferred← citeshttps://doi.org/10.1287/mnsc.47.5.679.10485openalex-snapshot
Ending Inventory Valuation in Multiperiod Production Scheduling
inferred← citeshttps://doi.org/10.1287/msom.1080.0218openalex-snapshot
Optimal Backlogging Over an Infinite Horizon Under Time-Varying Convex Production and Inventory Costs
inferred← citeshttps://doi.org/10.1287/msom.4.1.25.287openalex-snapshot
Forecast, Solution, and Rolling Horizons in Operations Management Problems: A Classified Bibliography
inferred← citeshttps://doi.org/10.1287/opre.42.3.456openalex-snapshot
Minimal Forecast Horizons and a New Planning Procedure for the General Dynamic Lot Sizing Model: Nervousness Revisited
inferred← citeshttps://doi.org/10.1371/journal.pone.0187725openalex-snapshot
Forecast horizon of multi-item dynamic lot size model with perishable inventory
inferred← citeshttps://doi.org/10.24275/uami.cn69m416copenalex-snapshot
Políticas óptimas de procesos de decisión de Markov descontados: unicidad y aproximación
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.