Dynamic lot sizing with minimum order size and lost sales
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
Dynamic lot sizing is the problem of determining the quantity and timing of ordering items while satisfying the demand over a finite planning horizon. This paper considers the problem with two practical considerations: minimum order size and lost sales. The minimum order size is the minimum amount of items that should be purchased and lost sales involve situations in which sales are lost because items are not on hand or when it becomes more economical to lose the sale rather than making the sale. The objective is to minimize the costs of ordering, item , inventory holding and lost sale over the planning horizon. To solve the problem, we suggest a heuristic algorithm by considering trade-offs between cost factors. Computational experiments on randomly generated test instances show that the algorithm quickly obtains near-optimal solutions.
Abstract
Dynamic lot sizing is the problem of determining the quantity and timing of ordering items while satisfying the demand over a finite planning horizon. This paper considers the problem with two practical considerations: minimum order size and lost sales. The minimum order size is the minimum amount of items that should be purchased and lost sales involve situations in which sales are lost because items are not on hand or when it becomes more economical to lose the sale rather than making the sale. The objective is to minimize the costs of ordering, item , inventory holding and lost sale over the planning horizon. To solve the problem, we suggest a heuristic algorithm by considering trade-offs between cost factors. Computational experiments on randomly generated test instances show that the algorithm quickly obtains near-optimal solutions.
참고문헌 (13)
- Anderson, E. J., "Capacitated lot-sizing with minimum batch sizes and setup times", International Journal of Production Economics, 30, pp.137~152 (1993)
- Aksen, D., "The single-item lot-sizing problem with immediate lost sale", European Journal of Operational Research, 14, pp.558~566 (2003)
- Brahimi, N., "Single item lot sizing problems", European Journal of Operational Research, 168, pp.1~16 (2006)
- Chu, F., "Polynomial algorithms for single-item lot-sizing models with bounded inventory and backlogging or outsourcing", IEEE Transactions on Automation Science and Engineering, 4, pp.233~251 (2007)
- Chu, F., "Singe-item dynamic lot-sizing models with bounded inventory and outsourcing", IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 38, pp.70~77 (2008)
- Jans, R., "Modeling industrial lot sizing problems: a review", International Journal of Production Research, 46, pp.1619~1643 (2008)
- Karimi, B., "The capacitated lot sizing problem: a review of models and algorithms, Omega - The", International Journal of Management Science, 31, pp.365~378 (2003)
- Liu, X., "Lot sizing with bounded inventory and lost sale", International Journal of Production Research, 45, pp.5881~5894 (2007)
- Merce, C., "MIP-based heuristics for capacitated lotsizing problems", International Journal of Production Economics, 85, pp.97~111 (2003)
- Okhrin, I., "The single item dynamic lot sizing problem with minimum lot size restriction", In: Operations Research Proceedings 2008, pp.91~96 (2008), Springer
- Sandbothe, R. A., "A forward algorithm for the capacitated lot size model with stockouts", Operations Research, 38, pp.474~486 (1990)
- Sandbothe, R. A., "Decision horizons for the capacitated lot size model with inventory bounds and stockouts", Computers & Operations Research, 20, pp.455~465 (1993)
- Wagner, H. M., "Dynamic version of the economic lot size mode", Management Science, 50A, pp.89~96 (1958)