A comparison of heuristic algorithms for cost-oriented assembly line balancing
暂无分享,去创建一个
[1] James R. Jackson,et al. A Computing Procedure for a Line Balancing Problem , 1956 .
[2] Maurice Kilbridge,et al. A REVIEW OF ANALYTICAL SYSTEMS OF LINE BALANCING , 1962 .
[3] Rainer Hahn,et al. Produktionsplanung bei Linienfertigung , 1972 .
[4] Reiner Steffen,et al. Produktionsplanung bei Fließbandfertigung , 1977 .
[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[6] M. Garey. Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .
[7] Robert E. Tarjan,et al. Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms , 1980, SIAM J. Comput..
[8] Roger V. Johnson. Assembly line balancing algorithms: computation comparisons , 1981 .
[9] David S. Johnson,et al. Approximation Algorithms for Bin Packing Problems: A Survey , 1981 .
[10] Giorgio Ausiello,et al. Analysis and design of algorithms in combinatorial optimization , 1981 .
[11] Michael J. Magazine,et al. Assembly line balancing as generalized bin packing , 1982, Oper. Res. Lett..
[12] William V. Gehrlein,et al. A comparative evaluation of heuristic line balancing techniques , 1986 .