To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Languages
Recent
Show all languages
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds

# Economic lot scheduling problem

The economic lot scheduling problem (ELSP) is a problem in operations management and inventory theory that has been studied by a large number of researchers for more than 50 years. The term was first used in 1958 by professor Jack D. Rogers of Berkeley,[1] who extended the economic order quantity model to the case where there are several products to be produced on the same machine, so that one must decide both the lot size for each product and when each lot should be produced. The method illustrated by Jack D. Rogers draws on a 1956 paper from Welch, W. Evert.[2] The ELSP is a mathematical model of a common issue for almost any company or industry: planning what to manufacture, when to manufacture and how much to manufacture.

• 1/5
Views:
6 378
2 411
21 803
120 471
8 597
• ✪ Mod-04 Lec-16 Economic lot scheduling problem, Supply Chain inventory
• ✪ Managerial Economics: Optimal Lot Size (Inventory Holdings)
• ✪ Material Requirments Planning (MRP) using Lot for Lot
• ✪ MRP - Material Requirements Plan
• ✪ Mod-05 Lec-18 Lot sizing -- heuristics

## Model formulation

The classic ELSP is concerned with scheduling the production of several products on a single machine in order to minimize the total costs incurred (which include setup costs and inventory holding costs).

We assume a known, non-varying demand ${\displaystyle d_{j},j=1,\cdots ,m}$ for the m products (for example, there might be m=3 products and customers require 7 items a day of Product 1, 5 items a day of Product 2 and 2 items a day of Product 3). Customer demand is met from inventory and the inventory is replenished by our production facility.

A single machine is available which can make all the products, but not in a perfectly interchangeable way. Instead the machine needs to be set up to produce one product, incurring a setup cost and/or setup time, after which it will produce this product at a known rate ${\displaystyle P_{j}}$. When it is desired to produce a different product, the machine is stopped and another costly setup is required to begin producing the next product. Let ${\displaystyle S_{ij}}$ be the setup cost when switching from product i to product j and inventory cost ${\displaystyle h_{j}}$ is charged based on average inventory level of each item. N is the number of runs made, U the use rate, L the lot size and T the planning period.

To give a very concrete example, the machine might be a bottling machine and the products could be cases of bottled apple juice, orange juice and milk. The setup corresponds to the process of stopping the machine, cleaning it out and loading the tank of the machine with the desired fluid. This product switching must not be done too often or the setup costs will be large, but equally too long a production run of apple juice would be undesirable because it would lead to a large inventory investment and carrying cost for unsold cases of apple juice and perhaps stock-outs in orange juice and milk. The ELSP seeks the optimal trade off between these two extremes.

## Rogers algorithm

1.Define:

${\displaystyle \theta =T/N=L/U}$ = use period
cL=${\displaystyle {\frac {hL(P-U)}{2PU}}+{\frac {S}{L}}}$, the unit cost for a lot of size L
${\displaystyle C_{N}=NLc_{L}=UT\left[{\frac {hL\left(P-U\right)}{2PU}}+{\frac {S}{L}}\right]}$ the total cost for N lots. To obtain the optimum we impose:
${\displaystyle {\frac {d(C_{N})}{dL}}={\frac {hT\left(P-U\right)}{2P}}-{\frac {SUT}{L^{2}}}=0}$
Which yields ${\displaystyle L_{0}={\sqrt {\frac {2USP}{h(P-U)}}}}$ as the optimum lot size. Now let:
${\displaystyle C_{N_{L\pm a}}=UT\left[{\frac {h\left(L\pm a\right)\left(P-U\right)}{2PU}}+{\frac {S}{L\pm a}}\right]}$ be the total cost for NL±alots of size L±a
${\displaystyle +\Delta =C_{N_{L+a}}-C_{N}=UT\left[{\frac {ha\left(P-U\right)}{2PU}}-{\frac {S}{{\frac {L^{2}}{a}}+L}}\right]}$ be the incremental cost of changing from size L to L+a
${\displaystyle -\Delta =C_{N_{L-a}}-C_{N}=UT\left[-{\frac {ha\left(P-U\right)}{2PU}}+{\frac {S}{{\frac {L^{2}}{a}}-L}}\right]}$ be the incremental cost of changing from size L to L-a

2.

Total quantity of an item required = UT
Total production time for an item = UT/P
Check that productive capacity is satisfied:
${\displaystyle \sum _{i=1}^{m}{\frac {U_{i}T}{P_{i}}}\leq T}$
${\displaystyle \sum _{i=1}^{m}{\frac {U_{i}}{P_{i}}}\leq 1}$

3.Compute:

${\displaystyle \theta _{0}={\frac {L_{0}}{U}}}$ as a whole number
If for a certain item, θ0 is not an even number, calculate:
${\displaystyle L=U\left(\theta _{0}+1\right)}$
${\displaystyle L=U\left(\theta _{0}-1\right)}$
And change L0 to L in the direction which incurs the least cost increase between +Δ and -Δ

4.Compute tp=L/P for each item and list items in order of increasing θ=L/U

5.For each pair of items ij check:

${\displaystyle \theta _{i}-t_{p_{i}}\geq t_{p_{j}}}$
${\displaystyle \theta _{j}-t_{p_{j}}\geq t_{p_{i}}}$
To forms pairs take the ith with the i+1th, i+2th, etc. If any of these inequalities is violated, calculate +Δ and -Δ for lot size increments of 2U and in order of size of cost change make step-by-step lot size changes. Repeat this step until both inequalities are satisfied.

6.${\displaystyle e_{ij}=d-t_{p_{i}}\leq \theta _{i}-t_{p_{i}}-t_{p_{j}}}$

1. Form all possible pairs as in Step 5
2. For each pair, select θi < θj
3. Determine whether tpi > tpj, tpi < tpj or tpi = tpj
4. Select a value for eij(eij=0,1,2,3,...,θi - tpi - tpj) and calculate tpi+e and tpj+e
5. Calculate Miθi-Mjθj by setting Mi=k and Mj=1,2,3,...,T/θj; ∀k∈(1,2,...,T/θi). Then check if one of the following boundary conditions is satisfied:
for ${\displaystyle t_{p_{i}}>t_{p_{j}}}$ or ${\displaystyle t_{p_{i}}${\displaystyle {\begin{cases}t_{p_{i}}+e\geq M_{i}\theta _{i}-M_{j}\theta _{j}>e\\t_{p_{i}}+e>M_{i}\theta _{i}-M_{j}\theta _{j}\geq t_{p_{i}}+e\\t_{p_{j}}+e\geq M_{i}\theta _{i}-M_{j}\theta _{j}>t_{p_{i}}+e\\t_{p_{i}}+t_{p_{j}}+e>M_{i}\theta _{i}-M_{j}\theta _{j}\geq t_{p_{j}}+e\end{cases}}}$
for ${\displaystyle t_{p_{i}}=t_{p_{j}}}$ ${\displaystyle {\begin{cases}t_{p_{i}}+e>M_{i}\theta _{i}-M_{j}\theta _{j}>e\\t_{p_{i}}+t_{p_{j}}+e>M_{i}\theta _{i}-M_{j}\theta _{j}>t_{p_{j}}+e\\t_{p_{i}}+e=M_{i}\theta _{i}-M_{j}\theta _{j}=t_{p_{j}}+e\end{cases}}}$
If none of the boundary conditions is satisfied then eij is non-interfering: if i=1 in eij, pick the next larger e in sub-step 4, if i≠1 go back to sub-step 2. If some boundary condition is satisfied go to sub-step 4. If, for any pair, no non-interfering e appears, go back to Step 5.

7.Enter items in schedule and check it's feasibility

## Stochastic ELSP

Of great importance in practice is to design, plan and operate shared capacity across multiple products with changeover times and costs in an uncertain demand environment. Beyond the selection of (expected) cycle times, with some amount of slack designed in ("safety time"), one has to also consider the amount of safety stock (buffer stock) that is needed to meet desired service level.[3]

## Problem status

The problem is well known in the operations research community, and a large body of academic research work has been created to improve the model and to create new variations that solve specific issues.

The model is known as a NP-hard problem since it is not currently possible to find the optimal solution without checking nearly every possibility. What has been done follows two approaches: restricting the solution to be of a specific type (which makes it possible to find the optimal solution for the narrower problem), or approximate solution of the full problem using heuristics or genetic algorithms.[4]

## References

1. ^ Jack D. Rogers: A Computational Approach to the Economic Lot Scheduling Problem, Management Science, Vol. 4, No. 3, April 1958, pp. 264–291
2. ^ Welch, W. Evert, A Case of Simple Linear Programming, Management Methods 1956 in Jack D. Rogers: A Computational Approach to the Economic Lot Scheduling Problem, Management Science, Vol. 4, No. 3, April 1958, pp. 264–291
3. ^ Tayur, S. (2000). "Improving Operations and Quoting Accurate Lead Times in a Laminate Plant". Interfaces. 30 (5): 1–15. doi:10.1287/inte.30.5.1.11637.
4. ^ Zipkin Paul H., Foundations of Inventory Management, Boston: McGraw Hill, 2000, ISBN 0-256-11379-3