ULSAlgorithms 1.1.0-g3e5595996d
High-performance exact and heuristic algorithms for uncapacitated lot sizing
Loading...
Searching...
No Matches
Least Unit Cost

Least Unit Cost

Class: ULSAlgorithms.Heuristics.LeastUnitCostSolver

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

Description

Least Unit Cost is a fast ULS heuristic in the Average-cost 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 LeastUnitCostSolver();
UlsSolveResult result = solver.Solve(problem);

Scientific source

Classical Least Unit Cost (LUC) lot-sizing rule

Full class reference

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