Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
일상적인 납기구간 롯사이징 문제에 대한 O(nT) 알고리듬
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | 배성문 | - |
| dc.contributor.author | 황학진 | - |
| dc.contributor.author | 김상원 | - |
| dc.contributor.author | 김종래 | - |
| dc.date.accessioned | 2022-12-27T06:22:57Z | - |
| dc.date.available | 2022-12-27T06:22:57Z | - |
| dc.date.issued | 2008 | - |
| dc.identifier.issn | 2005-7776 | - |
| dc.identifier.issn | 2713-573X | - |
| dc.identifier.uri | https://scholarworks.gnu.ac.kr/handle/sw.gnu/27750 | - |
| dc.description.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. | - |
| dc.format.extent | 8 | - |
| dc.language | 영어 | - |
| dc.language.iso | ENG | - |
| dc.publisher | 한국경영공학회 | - |
| dc.title | 일상적인 납기구간 롯사이징 문제에 대한 O(nT) 알고리듬 | - |
| dc.title.alternative | O(nT) Algorithm for Dynamic Lot-Sizing Problem with Agreeable Demand Time Windows | - |
| dc.type | Article | - |
| dc.publisher.location | 대한민국 | - |
| dc.identifier.bibliographicCitation | 한국경영공학회지, v.13, no.3, pp 249 - 256 | - |
| dc.citation.title | 한국경영공학회지 | - |
| dc.citation.volume | 13 | - |
| dc.citation.number | 3 | - |
| dc.citation.startPage | 249 | - |
| dc.citation.endPage | 256 | - |
| dc.identifier.kciid | ART001295080 | - |
| dc.description.isOpenAccess | N | - |
| dc.description.journalRegisteredClass | kci | - |
| dc.subject.keywordAuthor | Dynamic Lot-Sizing Model | - |
| dc.subject.keywordAuthor | Agreeable Demand Time Window | - |
| dc.subject.keywordAuthor | Dynamic Programming | - |
- 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.