Abstract
This paper proposes a modification of the Least Unit Cost (LUC) heuristic for the case of deterministic time-varying demands. The LUC heuristic is to select the number of periods covered by the replenishment order such that the total relevant cost per unit of demand is minimized. This study presents a modified version of the LUC by adding a procedure at the end of the LUC, and tests the following condition: whether the elimination of last replenishment lot by combining it with the preceding order is cost-effective. If the condition holds, then removes the last order by merging it with the preceding replenishment lot and the total costs are reduced. Numerical examples are provided to demonstrate its practical usage.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
