Bahl–Taj planning horizon

Bahl–Taj planning horizon

Class: ULSAlgorithms.Exact.WagnerWhitin.BahlTajPlanningHorizonSolver

Family: Planning-horizon DP
Time: O(T²) worst case
Memory: O(T)
Applicability: No speculative motive

Description

Bahl–Taj planning horizon is a direct exact ULS method in the Planning-horizon DP family. It solves the problem without requiring an external mathematical-programming engine and returns an optimal solution when its applicability conditions are satisfied.

Minimal API

IUlsSolver solver = new BahlTajPlanningHorizonSolver();
UlsSolveResult result = solver.Solve(problem);

Scientific source

Bahl & Taj (1991), A data-dependent efficient implementation of the Wagner-Whitin algorithm for lot-sizing, Computers & Industrial Engineering 20(2), 289-291

Full class reference

Use the Doxygen Classes index for constructors, members and source-level documentation.