Discrete Lot-Sizing and Scheduling Problem with Wagner-Whitin Costs

摘要

The authors consider the single-item discrete lot-sizing and scheduling problem.They present a partial linear description of the convex hull of feasible solutions that solves this problem in the presence of Wagner-Whitin costs.