Name
Abstract | ||
|---|---|---|
This work addresses a single item capacitated dynamic lot sizing problem. We consider backlogging models as well as out-sourcing models to minimize the total cost. The production, holding and backlogging or out-sourcing cost functions considered in This work are arbitrary and time-varying. Due to various capacity constraints, it is possible that no feasible solution exists. We give a necessary and sufficient condition for there to be a feasible solution and show that this condition can be checked in polynomial time. When feasible solutions exist, we show that an optimal solution can be obtained in pseudo-polynomial time with dynamic programming algorithms. We then address polynomially solvable special cases of stockout and conservation models. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/ICSMC.2004.1401214 | SMC (5) |
Keywords | Field | DocType |
pseudopolynomial time,lot sizing,dynamic programming algorithms,capacitated lot-sizing,cost functions,outsourcing,backlogging,backlogging models,dynamic programming,lot sizing models,out-sourcing,outsourcing models,dynamic programming algorithm,polynomial time,cost function | Dynamic programming,Mathematical optimization,Computer science,Outsourcing,Sizing,Time complexity,Total cost,Stockout | Conference |
Volume | ISSN | ISBN |
5 | 1062-922X | 0-7803-8566-7 |
Citations | PageRank | References |
2 | 0.55 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Feng Chu | 1 | 1030 | 78.80 |
| Chengbin Chu | 2 | 1486 | 126.84 |
| Xiao LIU | 3 | 59 | 8.40 |