Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/29258
Full metadata record
DC FieldValueLanguage
dc.contributor.authorChen, Z-
dc.contributor.authorZhang, R-Q-
dc.date.accessioned2024-06-23T15:13:13Z-
dc.date.available2019-04-29-
dc.date.available2024-06-23T15:13:13Z-
dc.date.issued2019-04-29-
dc.identifierORCiD: Zhen Chen https://orcid.org/0000-0002-1619-3017-
dc.identifier.citationChen, Z. and Zhang, R.-Q. (2021) 'A cash-constrained dynamic lot-sizing problem with loss of goodwill and credit-based loan', International Transactions in Operational Research, 28 (5), pp. 2841 - 2866. doi: 10.1111/itor.12675.en_US
dc.identifier.issn0969-6016-
dc.identifier.urihttps://bura.brunel.ac.uk/handle/2438/29258-
dc.description.abstractWe consider a small retailer that manages its inventory under a strict cash constraint. At each period, the retailer's available cash restricts the maximum inventory level that it can replenish. These retailers are nanostores, which are widely present in emerging markets, or small online retailers in some Chinese e-commerce platforms. We assume that the retailer can decide the satisfied demand quantity even if it has enough inventory, but unsatisfied demand in one period may cause customer demand to decrease in the next period considering the loss of goodwill. The retailer could adopt a credit-based loan provided by its suppliers or e-commerce platforms to alleviate cash shortages. A profit maximization single-item lot-sizing model is constructed for this problem. Numerical tests demonstrate that cash-flow constraint is different from traditional capacity constraint, and that cash availability, as well as loan interest rate, can substantially affect a retailer's optimal lot-sizing decisions. Our model can help a retailer decide at the beginning of the planning horizon whether it is worth applying for a credit-based loan with a given loan policy. We prove that the zero-inventory-ordering property still holds for certain situations, and propose a polynomial algorithm with heuristic adjustments to solve this problem when customers' payment delay length can be neglected. If unit variable ordering costs are equal and the loss of goodwill rate is zero, the algorithm can obtain optimal solutions. Under other situations, comparisons with CPLEX 12.6.2 show that our algorithm can reach optimal performance in most cases, and it has a computation time advantage for large-sized problems.en_US
dc.description.sponsorshipFundamental Research Funds for the Central Universities of China. Grant Number: SWU1909738; National Natural Science Foundation of China. Grant Numbers: 71571006, 71672015en_US
dc.format.extent2841 - 2866-
dc.format.mediumPrint-Electronic-
dc.languageEngllsh-
dc.language.isoen_USen_US
dc.publisherWiley on behalf of International Federation of Operational Research Societiesen_US
dc.rightsCopyright © 2019 The Authors. International Transactions in Operational Research © 2019 International Federation of Operational Research Societies.. This is the preprint version of the following article: Chen, Z. and Zhang, R.-Q. (2021) 'A cash-constrained dynamic lot-sizing problem with loss of goodwill and credit-based loan', International Transactions in Operational Research, 28 (5), pp. 2841 - 2866, which has been published in final form at https://doi.org/10.1111/itor.12675. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Use of Self-Archived Versions (see: https://authorservices.wiley.com/author-resources/Journal-Authors/licensing/self-archiving.html).-
dc.rights.urihttps://authorservices.wiley.com/author-resources/Journal-Authors/licensing/self-archiving.html-
dc.subjectcash constrainten_US
dc.subjectprofit maximizationen_US
dc.subjectlot sizingen_US
dc.subjectcustomer goodwillen_US
dc.subjectloanen_US
dc.titleA cash-constrained dynamic lot-sizing problem with loss of goodwill and credit-based loanen_US
dc.typeArticleen_US
dc.identifier.doihttps://doi.org/10.1111/itor.12675-
dc.relation.isPartOfInternational Transactions in Operational Research-
pubs.issue5-
pubs.publication-statusPublished-
pubs.volume28-
dc.identifier.eissn1475-3995-
dc.rights.holderThe Authors, International Transactions in Operational Research, International Federation of Operational Research Societies-
Appears in Collections:Brunel Business School Research Papers

Files in This Item:
File Description SizeFormat 
Preprint.pdf2.07 MBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.