Heuristic procedure for a multiproduct dynamic lot‐sizing problem with coordinated replenishments

Chia‐Shin Chung and H. Murat Mercan

Naval Research Logistics (NRL), 1994, vol. 41, issue 2, 273-286

Abstract: In this article we develop a heuristic procedure for a multiproduct dynamic lot‐sizing problem. In this problem a joint setup cost is incurred when at least one product is ordered in a period. In addition to the joint setup cost a separate setup cost for each product ordered is also incurred. The objective is to determine the product lot sizes, over a finite planning horizon, that will minimize the total relevant cost such that the demand in each period for each product is satisfied without backlogging. In this article we present an effective heuristic procedure for this problem. Computational results for the heuristic procedure are also reported. Our computational experience leads us to conclude that the heuristic procedure may be of considerable value as a decision‐making aid to production planners in a real‐world setting. © 1994 John Wiley & Sons, Inc.

Date: 1994
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199403)41:23.0.CO;2-V

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:41:y:1994:i:2:p:273-286

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().