Abstract

AbstractTwo types of flow processes are described and formulated, a shuttle and an assembly‐line process. Variations ofeachare studied for the general N‐stage condition. The shuttle process is considered for multiple shuttles per stage and the combination of multiple shuttles per stage with storage capacity at the nodes. The assembly‐line process is considered for multiple machines per stage, both with and without setup times included. The mathematical method of recurrence relations is used to formulate these relations for the various delay and arrival times of the items in each process. It is demonstrated that certain types of shuttle and assembly‐line processes are completely analogous. All known solutions of one process may then be applied to the other.

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.