Abstract
SUMMARY In this paper we develop a cost model for the single-model stochastic assembly line balancing problem for the objective of minimizing the total labour cost (dicated by the number of stations on the line) and the expected incompletion cost arising from tasks not completed within the prescribed cycle time. Its use is demonstrated in a dynamic programming procedure which is implemented using a bounding strategy to curtail storage and computational requirements. The solutions obtained are compared with those obtained using the procedure of Kottas and Lau (1973,1981).
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.
