Abstract
Abstract In this paper I describe a consecutiveness rule for grouping N retailers into m groups with independent single-cycle policies for each group which enables the creation of groups using a shortest-path approach. I also suggest a very efficient algorithm to compute the lot sizes for any single-cycle policy which can easily be incorporated into the shortest-path model for the creation of m single-cycle groups.
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.
