Fast Solution and Detection of Minimal Forecast Horizons in Dynamic Programs with a Single Indicator of the Future: Applications to Dynamic Lot-Sizing Models

In most dynamic planning problems, one observes that an optimal decision at any given stage depends on limited information, i.e., information pertaining to a limited set of adjacent or nearby stages. This holds in particular for planning problems over time, where an optimal decision in a given perio...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Management science Jg. 41; H. 5; S. 874 - 893
Hauptverfasser: Federgruen, Awi, Tzur, Michal
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Linthicum, MD INFORMS 01.05.1995
Institute for Operations Research and the Management Sciences
Schriftenreihe:Management Science
Schlagworte:
Algorithms
applications to lotsizing
Applied sciences
Carrying costs
Cost efficiency
Cost functions
Cost structure
Dynamic modeling
Dynamic programming
Dynamics
Exact sciences and technology
fast solution and detection
Forecasting
Forecasting models
Forecasts
Information
Integers
Inventory control, production control. Distribution
Management
Management science
Mathematical independent variables
Mathematical models
minimal forecast horizons
Operational research and scientific management
Operational research. Management science
Roots of functions
Studies
Algorithms
Material requirements planning
Production control
Supply
Lot sizing
Optimal planning
Fast algorithm
Dynamic model
Forecast model
Modeling
Method study
ISSN:0025-1909, 1526-5501
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In most dynamic planning problems, one observes that an optimal decision at any given stage depends on limited information, i.e., information pertaining to a limited set of adjacent or nearby stages. This holds in particular for planning problems over time, where an optimal decision in a given period depends on information related to a limited future time horizon, a so-called forecast horizon, only. In this paper we identify a general class of dynamic programs in which an efficient forward algorithm can be designed to solve the problem and to identify minimal forecast horizons. Such a procedure specifies necessary and sufficient conditions for a stage to arise as a forecast horizon. This class of dynamic programs includes the single-item dynamic lot-sizing model with general concave costs, both with and without backlogging, to which special attention is given.
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
content type line 23
ISSN:0025-1909
1526-5501
DOI:10.1287/mnsc.41.5.874