Solving the Lot Sizing Problem in Resolver One (Wagner-Whitin Algorithm)

I was working on a lot sizing problem today and implemented a Wagner-Whitin algorithm in Resolver One. I just want to share it with you here. Some people use a MIP solver to solve lot sizing problems while Wagner and Whitin have devised an algorithm that can be implemented quickly on a spreadsheet and there is no need to use an expensive solver. You can download the spreadsheet from this link.

In the classical lot sizing problem we have the following assumptions:

1. We have a single product (with the production quantity in period t)
2. Discrete Time (unlike EOQ model)
3. Demand is known but varies over time (e.g., we have orders)
4. No shortage is allowed
5. No capacity constraints
6. There is a positive setup cost that might be varying over time
7. The unit production cost is constant
8. The objective is to minimize the total setup cost and inventory costs

Here is the formulation for the model:

1. setup cost in period t
2. inventory holding cost per unit remaining at end of period t
3. demand in period t
4. a large number (will be used in the MIP model)
5. production quantity in period t
6. if and is 0 otherwise
7. inventory remaining at the end of period t

The MIP model will be:

1. 
2. 
3. 
4. 
5. 

Wagner and Whitin have solved this problem using the forward dynamic programming. In this spreadsheet we implement the forward dynamic programming for the lot sizing problem. The spreadsheet then suggests the time period than it is optimal to pay for the setup cost, in other time periods it is cheaper to carry an inventory.