A methodology for solving single-model, stochastic assembly line balancing problem
In this paper, a methodology is developed to solve the single-model, stochastic assembly line balancing problem for the objective of minimizing the total labor cost and the expected incompletion cost arising from tasks not completed within the prescribed cycle time. The methodology is based on determining an initial DP based solution and its improvement using a branch-and-bound procedure which uses an approximate solution instead of a lower bound for fathoming nodes. Detailed experimentation shows the superiority of this method over the most promising one from the literature.
Volume (Year): 27 (1999)
Issue (Month): 5 (October)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Allan L. Gutjahr & George L. Nemhauser, 1964. "An Algorithm for the Line Balancing Problem," Management Science, INFORMS, vol. 11(2), pages 308-315, November.
- Chakravarty, Amiya K. & Shtub, Avraham, 1986. "A cost minimization procedure for mixed model production lines with normally distributed task times," European Journal of Operational Research, Elsevier, vol. 23(1), pages 25-36, January.
- Fred N. Silverman & John C. Carter, 1986. "A Cost-Based Methodology for Stochastic Line Balancing with Intermittent Line Stoppages," Management Science, INFORMS, vol. 32(4), pages 455-463, April.