论文信息 - Assembly line balancing as generalized bin packing

Assembly line balancing as generalized bin packing

Bin packing heuristics are generalized and adapted to solve the assembly line balancing problem. Worst-case analysis is provided. The results are compared to those for a resource constrained scheduling problem considered by Garey, Graham, Johnson and Yao.

Michael J. Magazine | T. S. Wee | M. Magazine | T. S. Wee

[1] David S. Johnson,et al. Approximation Algorithms for Bin Packing Problems: A Survey , 1981 .

[2] James R. Jackson,et al. A Computing Procedure for a Line Balancing Problem , 1956 .

[3] Andrew Chi-Chih Yao,et al. New Algorithms for Bin Packing , 1978, JACM.

[4] Jeffrey D. Ullman,et al. Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..

[5] Andrew Chi-Chih Yao,et al. Resource Constrained Scheduling as Generalized Bin Packing , 1976, J. Comb. Theory A.

[6] George L. Nemhauser,et al. An Algorithm for the Line Balancing Problem , 1964 .

[7] Linus Schrage,et al. Dynamic Programming Solution of Sequencing Problems with Precedence Constraints , 1978, Oper. Res..