共 8 条
[1]
Baybars I., Survey of exact algorithms for the simple assembly line balancing problem, Management Science, 32, 8, pp. 909-932, (1986)
[2]
Garey M.B., Johnson D.S., Computers and Intractability: A Guide to the Theory of Np-Completeness, (1979)
[3]
Garey M.B., Johnson D.S., Approximate algorithms for the bin-packing problem: A survey, Analysis and Design of Algorithms in Combinatorial Optimization, pp. 178-190, (1981)
[4]
Johnson R.V., Optimally balancing large assembly lines with 'FABLE, Management Science, 34, 2, pp. 240-253, (1988)
[5]
Pinto P.A., Dannenbring D.G., Khumawala B.M., Branch and bound and heuristic procedures for assembly line balancing with parallel stations, International Journal of Production Research, 19, pp. 565-576, (1981)
[6]
Talbot B.F., Patterson J.H., An integer programming algorithm with network cuts solving the assembly line balancing problem, Management Science, 30, 1, pp. 85-99, (1984)
[7]
Talbot B.F., Patterson J.H., Gehrlein W.V., A comparative evaluation of heuristic line balancing techniques, Management Science, 32, 4, pp. 430-454, (1986)
[8]
Wee T.S., Magazine M.J., Assembly line balancing as generalized bin packing, Operations Research Letters, 1, pp. 56-58, (1982)