Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
일상적인 납기구간 롯사이징 문제에 대한 O(nT) 알고리듬O(nT) Algorithm for Dynamic Lot-Sizing Problem with Agreeable Demand Time Windows
- Other Titles
- O(nT) Algorithm for Dynamic Lot-Sizing Problem with Agreeable Demand Time Windows
- Issue Date
- 2008
- Publisher
- 한국경영공학회
- Keywords
- Dynamic Lot-Sizing Model; Agreeable Demand Time Window; Dynamic Programming
- Citation
- 한국경영공학회지, v.13, no.3, pp 249 - 256
- Pages
- 8
- Indexed
- KCI
- Journal Title
- 한국경영공학회지
- Volume
- 13
- Number
- 3
- Start Page
- 249
- End Page
- 256
- ISSN
- 2005-7776
2713-573X
- Abstract
- This paper considers the dynamic lot-sizing problem with agreeable time window. In agreeable time window structure in which each time window does not superimpose other time windows. For fixed and linear replenishment costs, we propose a dynamic programming algorithm with running time of O(nT) where n is the number of demands and T is the length of the planning horizon.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - 공과대학 > Department of Industrial and Systems Engineering > Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.