The Silver–Meal heuristic is a production planning method in manufacturing, composed in 1973[1] by Edward A. Silver and H.C. Meal. Its purpose is to determine production quantities to meet the requirement of operations at minimum cost.
The method is an approximate heuristic for the dynamic lot-size model, perceived as computationally too complex.
The Silver–Meal heuristic is a forward method that requires determining the average cost per period as a function of the number of periods the current order is to span and stopping the computation when this function first increases.
Define :
K: the setup cost per lot produced.
h: holding cost per unit per period. C(T) : the average holding and setup cost per period if the current order spans the next T periods.Let (r1, r2, r3, .......,rn) be the requirements over the n-period horizon.
To satisfy the demand for period 1
C(1)=K
To satisfy the demand for period 1, 2Producing lot 1 and 2 in one setup give us an average cost:
C(2)=
K+hr2 | |
2 |
To satisfy the demand for period 1, 2, 3Producing lot 1, 2 and 3 in one setup give us an average cost:
C(3)=
K+hr2+2hr3 | |
3 |
In general,
C(j)=
K+hr2+2hr3+...+(j-1)hrj | |
j |
Once C(j) > C(j − 1), stop and produce r1 + r2 + r3 + ... + rj − 1 And, begin the process again starting from period j.