View in EDS HTML Full Text PDF Full Text

Dynamic lot sizing with inventory bounds for a perishable product.

Saved in:
Bibliographic Details
Title: Dynamic lot sizing with inventory bounds for a perishable product.
Authors: Fan, Jie1 (AUTHOR), Mo, Zhuhao1 (AUTHOR), Su, Yong1 (AUTHOR), Tao, Yi1 (AUTHOR) oryitao@foxmail.com
Source: International Journal of Production Research. Apr2026, Vol. 64 Issue 7, p2712-2730. 19p.
Subjects: Perishable goods, Inventory control, Cost, Dynamic programming, Expiration, Economic lot size, Computer storage capacity
Abstract: We investigate a dynamic lot-sizing problem with storage capacities for a perishable product that has a certain expiration date. The costs of carrying inventory stocks are differentiated by their ages, and the procurement cost functions are assumed to be general concave. We identify a condition related to the storage capacity constraint, under which the expiration date can be ignored. Then, the structural properties of the optimal solution are discussed. We use the properties to develop an efficient dynamic programming algorithm to solve the problem optimally. A faster algorithm is provided to solve a special case with fixed-plus-linear procurement costs. We conduct computational experiments to evaluate the efficiency of our algorithm and provide several insights into perishable inventory management under storage capacities. [ABSTRACT FROM AUTHOR]
Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Full text is not displayed to guests.
FullText Links:
  – Type: pdflink
Text:
  Availability: 1
Header DbId: egs
DbLabel: Engineering Source
An: 192503675
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Dynamic lot sizing with inventory bounds for a perishable product.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Fan%2C+Jie%22">Fan, Jie</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Mo%2C+Zhuhao%22">Mo, Zhuhao</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Su%2C+Yong%22">Su, Yong</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Tao%2C+Yi%22">Tao, Yi</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> oryitao@foxmail.com</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22International+Journal+of+Production+Research%22">International Journal of Production Research</searchLink>. Apr2026, Vol. 64 Issue 7, p2712-2730. 19p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Perishable+goods%22">Perishable goods</searchLink><br /><searchLink fieldCode="DE" term="%22Inventory+control%22">Inventory control</searchLink><br /><searchLink fieldCode="DE" term="%22Cost%22">Cost</searchLink><br /><searchLink fieldCode="DE" term="%22Dynamic+programming%22">Dynamic programming</searchLink><br /><searchLink fieldCode="DE" term="%22Expiration%22">Expiration</searchLink><br /><searchLink fieldCode="DE" term="%22Economic+lot+size%22">Economic lot size</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+storage+capacity%22">Computer storage capacity</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: We investigate a dynamic lot-sizing problem with storage capacities for a perishable product that has a certain expiration date. The costs of carrying inventory stocks are differentiated by their ages, and the procurement cost functions are assumed to be general concave. We identify a condition related to the storage capacity constraint, under which the expiration date can be ignored. Then, the structural properties of the optimal solution are discussed. We use the properties to develop an efficient dynamic programming algorithm to solve the problem optimally. A faster algorithm is provided to solve a special case with fixed-plus-linear procurement costs. We conduct computational experiments to evaluate the efficiency of our algorithm and provide several insights into perishable inventory management under storage capacities. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=192503675
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1080/00207543.2025.2582071
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 19
        StartPage: 2712
    Subjects:
      – SubjectFull: Perishable goods
        Type: general
      – SubjectFull: Inventory control
        Type: general
      – SubjectFull: Cost
        Type: general
      – SubjectFull: Dynamic programming
        Type: general
      – SubjectFull: Expiration
        Type: general
      – SubjectFull: Economic lot size
        Type: general
      – SubjectFull: Computer storage capacity
        Type: general
    Titles:
      – TitleFull: Dynamic lot sizing with inventory bounds for a perishable product.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Fan, Jie
      – PersonEntity:
          Name:
            NameFull: Mo, Zhuhao
      – PersonEntity:
          Name:
            NameFull: Su, Yong
      – PersonEntity:
          Name:
            NameFull: Tao, Yi
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 04
              Text: Apr2026
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-print
              Value: 00207543
          Numbering:
            – Type: volume
              Value: 64
            – Type: issue
              Value: 7
          Titles:
            – TitleFull: International Journal of Production Research
              Type: main
ResultId 1