Computing minimal forecast horizons: an integer programming approach

DOI10.1007/s10852-005-9012-3zbMath1121.90094OpenAlexW3125684993MaRDI QIDQ853795

Srinagesh Gavirneni, Suresh P. Sethi, Sanjeewa Naranpanawe, Milind W. Dawande

Publication date: 17 November 2006

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-005-9012-3

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Management decision making, including multiple objectives (90B50)

Related Items

Dynamic lot-sizing model under perishability, substitution, and limited storage capacity, Efficient approximate algorithms for a class of dynamic lot size problems under product substitution, Forecast horizon of dynamic lot size model for perishable inventory with minimum order quantities, Forecast horizon for dynamic lot sizing model under product substitution and perishable inventories

Uses Software

• MINTO

Cites Work

• Unnamed Item
• A forward algorithm and planning horizon procedure for the production smoothing problem without inventory
• Forecast horizons and dynamic facility location planning
• Conditions for the existence of decision horizons for discounted problems in a stochastic environment: A note
• Optimization of a 532-city symmetric traveling salesman problem by branch and cut
• A perfect forward procedure for a single facility dynamic location/relocation problem
• A model for equipment replacement due to technological obsolescence
• A forward branch-and-search algorithm and forecast horizon results for the changeover scheduling problem
• MINTO, a Mixed INTeger Optimizer
• Capacity expansion with alternative technology choices
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• A Cutting Plane Algorithm for the Linear Ordering Problem
• Forecast horizon in nonstationary Markov decision problems
• Minimal forecast horizon procedures for dynamic lot size models
• Forecast horizons for the discounted dynamic lot-size problem allowing speculative motive
• Concepts of Forecast and Decision Horizons: Applications to Dynamic Stochastic Optimization Problems
• Algorithms and Planning Horizon Results for Production Planning Problems with Separable Costs
• A Perfect Planning Horizon Procedure for a Deterministic Cash Balance Problem
• Deterministic Capacity Expansion Under Deterioration
• Planning Horizons for the Dynamic Lot Size Model: Zabel vs. Protective Procedures and Computational Results
• Minimal Forecast Horizons and a New Planning Procedure for the General Dynamic Lot Sizing Model: Nervousness Revisited
• Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
• Planning horizon procedures for machine replacement models with several possible replacement alternatives
• Fast Solution and Detection of Minimal Forecast Horizons in Dynamic Programs with a Single Indicator of the Future: Applications to Dynamic Lot-Sizing Models
• Existence of Forecast Horizons in Undiscounted Discrete-Time Lot Size Models
• Detection of minimal forecast horizons in dynamic programs with multiple indicators of the future