Stochastic joint replenishment problem with quantity discounts and minimum order constraints
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Noh, Ji Seong | - |
dc.contributor.author | Kim, Jong Soo | - |
dc.contributor.author | Sarkar, Biswajit | - |
dc.date.accessioned | 2021-06-22T10:22:09Z | - |
dc.date.available | 2021-06-22T10:22:09Z | - |
dc.date.issued | 2019-03 | - |
dc.identifier.issn | 1109-2858 | - |
dc.identifier.issn | 1866-1505 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/3453 | - |
dc.description.abstract | This paper analyzes a logistics system involving a supplier who produces and delivers multiple types of items and a buyer who receives and sells to end customers. The buyer controls the inventory of each item by ordering at a preset time interval, which is an integer multiple of a base cycle, to meet the stochastic demands of the end customers. The supplier makes contracts with the buyer that specify that the ordered amount is delivered at the start of each period at a unit price determined by a quantity discount schedule. The contract also specifies that a buyer's order should exceed a minimum order quantity. To analyze the system, a mathematical model describing activities for replenishing a single type of item is developed from the buyer's perspective. An efficient method to determine the base cycle length and safety factor that minimizes the buyer's total cost is then proposed. The single item model is extended to a multiple items joint replenishment model, and algorithms for finding a cost-minimizing base cycle, order interval multipliers, and safety factors are proposed. The result of computational experiments shows that the algorithms can find near-optimal solutions to the problem. | - |
dc.format.extent | 28 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Springer Verlag | - |
dc.title | Stochastic joint replenishment problem with quantity discounts and minimum order constraints | - |
dc.type | Article | - |
dc.publisher.location | 독일 | - |
dc.identifier.doi | 10.1007/s12351-016-0281-6 | - |
dc.identifier.scopusid | 2-s2.0-85002165452 | - |
dc.identifier.wosid | 000459380000007 | - |
dc.identifier.bibliographicCitation | Operational Research, v.19, no.1, pp 151 - 178 | - |
dc.citation.title | Operational Research | - |
dc.citation.volume | 19 | - |
dc.citation.number | 1 | - |
dc.citation.startPage | 151 | - |
dc.citation.endPage | 178 | - |
dc.type.docType | Article | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Operations Research & Management Science | - |
dc.relation.journalWebOfScienceCategory | Operations Research & Management Science | - |
dc.subject.keywordPlus | ALGORITHM | - |
dc.subject.keywordPlus | IMPERFECT | - |
dc.subject.keywordPlus | POLICIES | - |
dc.subject.keywordPlus | MODEL | - |
dc.subject.keywordAuthor | Inventory control | - |
dc.subject.keywordAuthor | Joint replenishment problem | - |
dc.subject.keywordAuthor | Quantity discount | - |
dc.subject.keywordAuthor | Minimum order quantity | - |
dc.identifier.url | https://link.springer.com/article/10.1007/s12351-016-0281-6 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.