Name
Abstract | ||
|---|---|---|
This paper addresses a dynamic lot-sizing model with outsourcing. All the unsatisfied demands are out-sourced without backlogging, where the inventory capacity is limited and shortages are prohibited. Costs are concave and time va ying. Some new properties are obtained in an optimal solution and a dynamic programming algorithm is developed to solve the problem in strongly polynomial time. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/ICEBE.2005.9 | ICEBE |
Keywords | Field | DocType |
optimal solution,new property,dynamic lot-sizing model,polynomial time,unsatisfied demand,out-sourcing planning,inventory capacity,time va ying,dynamic programming algorithm,dynamic programming,computational complexity,outsourcing | Dynamic programming,Mathematical optimization,Computer science,Outsourcing,Strongly polynomial,Economic shortage,Computational complexity theory | Conference |
ISBN | Citations | PageRank |
0-7695-2430-3 | 2 | 0.48 |
References | Authors | |
4 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiao LIU | 1 | 59 | 8.40 |
| Chengen Wang | 2 | 156 | 9.99 |
| Xiaochuan Luo | 3 | 56 | 7.70 |
| Dingwei Wang | 4 | 718 | 60.49 |