Ho-Chang-Solis improved nLPC(i)

Ho-Chang-Solis improved nLPC(i)

Class: ULSAlgorithms.Heuristics.HoChangSolisImprovedNetLeastPeriodCostSolver

Family: Average-cost / net period
Time: O(T)
Memory: O(T)
Applicability: Stationary setup, production and relevant holding costs

Description

Ho-Chang-Solis improved nLPC(i) is a fast ULS heuristic in the Average-cost / net period family. It constructs a feasible replenishment plan without claiming an optimality proof. Use it only when the documented applicability conditions match the instance.

Minimal API

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

Scientific source

Ho, Chang & Solis (2006), Two modifications of the least cost per period heuristic for dynamic lot-sizing, Journal of the Operational Research Society 57(8), 1005-1013

Full class reference

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