Abstract
In this study, we are concerned with finding the minimum-total-buffer allocation for a desired throughput in production lines with phase-type processing times. We have implemented a dynamic programming algorithm that uses a decomposition method to approximate the system throughput at every stage. We provide numerical examples to show the buffer allocation and compare the corresponding simulated throughput and its bounds with the desired throughput.
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.
