Abstract

Coordination of order placing points, in a multi-item environment, becomes desirable as it reduces the set-up costs and eases the problem of order-control implementation. Because of the computational complexities most of the analysis in the literature is confined to single families of items. In this paper, we establish the basic property of item consecutiveness for the multi-family situation which facilitates a shortest-path formulation of optimal families. We also develop an efficient algorithm for lot size computations of a single family to be incorporated in the shortest-path model.

Full Text
Paper version not known

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 call

Disclaimer: 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.