TY - JOUR
T1 - Extensions of the dynamic programming method in the deterministic and stochastic assembly-line balancing problems
AU - Henig, Mordechai I.
PY - 1986
Y1 - 1986
N2 - The dynamic programming method which minimizes the number of stations for a given cycle time is extended here to solve two variants of the assembly-line balancing problem. The extended method minimizes cycle time for a given number of stations or, more generally, computes all nondominated pairs of cycle time and number of stations. The method is also applied to the stochastic case where minimizing critical cycle time, the number of stations and maximizing confidence level is desired.
AB - The dynamic programming method which minimizes the number of stations for a given cycle time is extended here to solve two variants of the assembly-line balancing problem. The extended method minimizes cycle time for a given number of stations or, more generally, computes all nondominated pairs of cycle time and number of stations. The method is also applied to the stochastic case where minimizing critical cycle time, the number of stations and maximizing confidence level is desired.
UR - http://www.scopus.com/inward/record.url?scp=0022910386&partnerID=8YFLogxK
U2 - 10.1016/0305-0548(86)90032-8
DO - 10.1016/0305-0548(86)90032-8
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0022910386
SN - 0305-0548
VL - 13
SP - 443
EP - 449
JO - Computers and Operations Research
JF - Computers and Operations Research
IS - 4
ER -