Lemoine-OR Algorithms
Description

What this method is

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.

How it works

Core idea

The method works directly on the ULS arrays using the algorithmic mechanism identified by its family and implementation note. No external optimizer is needed. The returned plan is reconstructed through the common ULS result model.

Implementation in ULSAlgorithmsData-dependent planning-horizon pruning
Use it

Minimal C# example

using ULSAlgorithms.Abstractions;
using ULSAlgorithms.Models;
using ULSAlgorithms.Exact.WagnerWhitin;

var problem = new UlsProblem(
    demands:             [20.0, 30.0, 25.0, 40.0],
    setupCosts:          [200.0, 200.0, 200.0, 200.0],
    unitProductionCosts: [0.0, 0.0, 0.0, 0.0],
    holdingCosts:        [4.0, 4.0, 4.0, 0.0]);

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

Console.WriteLine(result.Status);
Console.WriteLine(result.ObjectiveValue);

The input example intentionally uses stationary, positive-demand data so it is compatible with restricted methods too. Always check the applicability box for your own instance.

Scientific source

Reference & provenance

Bahl & Taj (1991), A data-dependent efficient implementation of the Wagner-Whitin algorithm for lot-sizing, Computers & Industrial Engineering 20(2), 289-291 · DOI 10.1016/0360-8352(91)90033-3